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

Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationParallel and Distributed Processing and Applications - 4th International Symposium, ISPA 2006, Proceedings
EditorsMinyi Guo, Laurence T Yang, Beniamino Di Martino, Hans P. Zima, Hans P. Zima, Jack Dongarra, Feilong Tang
PublisherSpringer Verlag
Pages39-50
Number of pages12
ISBN (Print)9783540680673
DOIs
Publication statusPublished - 2006
Event4th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2006 - Sorrento, Italy
Duration: Dec 4 2006Dec 6 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4330
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2006
CountryItaly
CitySorrento
Period12/4/0612/6/06

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Forest search: A paradigm for faster exploration of scale-free networks'. Together they form a unique fingerprint.

  • Cite this

    Kurumida, Y., Ono, H., Sadakane, K., & Yamashita, M. (2006). Forest search: A paradigm for faster exploration of scale-free networks. In M. Guo, L. T. Yang, B. Di Martino, H. P. Zima, H. P. Zima, J. Dongarra, & F. Tang (Eds.), Parallel and Distributed Processing and Applications - 4th International Symposium, ISPA 2006, Proceedings (pp. 39-50). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4330). Springer Verlag. https://doi.org/10.1007/11946441_9