{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:54:08Z","timestamp":1725472448062},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540680673"},{"type":"electronic","value":"9783540680703"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11946441_9","type":"book-chapter","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T10:52:47Z","timestamp":1163847167000},"page":"39-50","source":"Crossref","is-referenced-by-count":0,"title":["Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks"],"prefix":"10.1007","author":[{"given":"Yuichi","family":"Kurumida","sequence":"first","affiliation":[]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[]},{"given":"Masafumi","family":"Yamashita","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.-L.: Statistical Mechanics of Complex Networks. Reviews Of Modern Physics\u00a074, 47\u201397 (2002)","journal-title":"Reviews Of Modern Physics"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"11149","DOI":"10.1073\/pnas.200327197","volume":"97","author":"L.A.N. Amaral","year":"2000","unstructured":"Amaral, L.A.N., Scala, A., Barth\u00e9l\u00e9, M., Stanley, H.E.: Classes of small-world networks. Proceeding of The National Academy of Sciences\u00a097, 11149\u201311152 (2000)","journal-title":"Proceeding of The National Academy of Sciences"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Applied Mathematics\u00a065, 21\u201346 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0378-4371(99)00291-5","volume":"272","author":"A.-L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R., Jeong, H.: Mean-field theory for scale-free random networks. Physica A\u00a0272, 173\u2013187 (1999)","journal-title":"Physica A"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/rsa.1009","volume":"18","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B., Riordan, O.: The degree sequence of a scale-free random graph process. Random Structure and Algorithms\u00a018, 279\u2013290 (2001)","journal-title":"Random Structure and Algorithms"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00493-004-0002-2","volume":"24","author":"B. Bollobas","year":"2004","unstructured":"Bollobas, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica\u00a024, 5\u201334 (2004)","journal-title":"Combinatorica"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/rsa.3240010303","volume":"3","author":"G. Brightwell","year":"1990","unstructured":"Brightwell, G., Winkler, P.: Maximum Hitting Time for Random Walks on Graphs. J. Random Structures and Algorithms\u00a03, 263\u2013276 (1990)","journal-title":"J. Random Structures and Algorithms"},{"key":"9_CR8","first-page":"1","volume":"66","author":"H. Ebel","year":"2002","unstructured":"Ebel, H., Mielsch, L.-I., Bornholdt, S.: Scale-free topology of e-mail networks. Pysical Review E\u00a066, 1\u20134 (2002)","journal-title":"Pysical Review E"},{"key":"9_CR9","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs. Publ. Math. Debrecen\u00a06, 290\u2013297 (1959)","journal-title":"Publ. Math. Debrecen"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/rsa.3240060106","volume":"6","author":"U. Feige","year":"1995","unstructured":"Feige, U.: A tight upper bound on the cover time for random walks on graphs. J. Random Structures and Algorithms\u00a06, 51\u201354 (1995)","journal-title":"J. Random Structures and Algorithms"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0020-0190(97)00091-4","volume":"63","author":"P. Flocchini","year":"1997","unstructured":"Flocchini, P., Mans, B., Santoro, N.: On the Impact of Sense of Direction on Message Complexity. Inf. Process. Lett.\u00a063(1), 23\u201331 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s004460100058","volume":"14","author":"P. Fraigniaud","year":"2001","unstructured":"Fraigniaud, P., Gavoille, C., Mans, B.: Interval routing schemes allow broadcasting with linear message-complexity. Distributed Computing\u00a014(4), 217\u2013229 (2001)","journal-title":"Distributed Computing"},{"key":"9_CR13","unstructured":"Ikeda, S., Kubo, I., Yamashita, M.: Reducing the Hitting and the Cover Times of Random Walks on Finite Graphs by Local Topological Information. In: Proceedings of The 2003 International Conference on VLSI, pp. 203\u2013207 (2003)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Kurumida, Y., Ogata, T., Ono, H., Sadakane, K., Yamashita, M.: A Generic Search Strategy for Large Scale Real World Networks. In: Proc. of the 1st International Conference on Scalable Information Systems. ACM, Digital Library (2006)","DOI":"10.1145\/1146847.1146849"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1002\/1097-0037(200009)36:2<96::AID-NET4>3.0.CO;2-N","volume":"36","author":"P. Panaite","year":"2000","unstructured":"Panaite, P., Pelc, A.: Impact of topographic information on graph exploration efficiency. Networks\u00a036(2), 96\u2013103 (2000)","journal-title":"Networks"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature\u00a0393, 440\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11946441_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T19:10:14Z","timestamp":1683659414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11946441_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540680673","9783540680703"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11946441_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}