@inproceedings{oai:niigata-u.repo.nii.ac.jp:00031104,
 author = {森山, 俊行 and 田村, 裕 and 間瀬, 憲一 and 仙石, 正和 and 篠田, 庄司},
 book = {シミュレーション・テクノロジー・コンファレンス発表論文集, シミュレーション・テクノロジー・コンファレンス発表論文集},
 month = {Jun},
 note = {An ad-hoc network is composed of mobile terminals with personal communication devices. Information in ad-hoc network is sent from a source to all terminals. We consider how to sent information in the minimum step. In this report, we uses Ad-hoc network by PHSs (Personal Handyphone System) as example of problem. First, we substitute a problem of graph theory for that problem, and we propose some heuristic algorithms for the problem. After that, proposed algorithms are evaluated by the computer simulation.},
 pages = {185--188},
 publisher = {日本シミュレーション学会},
 title = {ユニバーサルアドホックネットワークにおける情報配信アルゴリズムのグラフ理論的考察},
 volume = {19},
 year = {2000}
}