Forest search: A paradigm for faster exploration of scale-free networks

Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

抄録

Scale-free networks naturally model wide area networks like the WWW. We consider the problem of fast exploration of huge scalefree networks using small memory space. Although there are many search algorithms for exploring an unknown graph, they require much space or time. For example, the depth first search requires some memory for all the nodes in the worst case, and the average number of steps in the random walk is O(n3), where n is the size of the graph. Under assumptions reflecting WWW applications, we propose a new exploration paradigm called forest search particularly designed for scale-free networks, and theoretically evaluate its space complexity. We also demonstrate its superiority over random walk based search algorithms by conducting simulations.

本文言語英語
ホスト出版物のタイトルParallel and Distributed Processing and Applications - 4th International Symposium, ISPA 2006, Proceedings
編集者Minyi Guo, Laurence T Yang, Beniamino Di Martino, Hans P. Zima, Hans P. Zima, Jack Dongarra, Feilong Tang
出版社Springer Verlag
ページ39-50
ページ数12
ISBN(印刷版)9783540680673
DOI
出版ステータス出版済み - 2006
イベント4th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2006 - Sorrento, イタリア
継続期間: 12月 4 200612月 6 2006

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4330
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他4th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2006
国/地域イタリア
CitySorrento
Period12/4/0612/6/06

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Forest search: A paradigm for faster exploration of scale-free networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル