{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:05:31Z","timestamp":1725537931344},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642049439"},{"type":"electronic","value":"9783642049446"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04944-6_11","type":"book-chapter","created":{"date-parts":[[2009,9,15]],"date-time":"2009-09-15T22:09:36Z","timestamp":1253052576000},"page":"127-140","source":"Crossref","is-referenced-by-count":2,"title":["Graph Embedding through Random Walk for Shortest Paths Problems"],"prefix":"10.1007","author":[{"given":"Yakir","family":"Berchenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mina","family":"Teicher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Galil, Z., Margalit, O., Naor, M.: Witnesses for Boolean matrix multiplication and for shortest paths. In: Proceeedings of the 33rd IEEE Symposium on Foundations of Computer Science, Pittsburgh, PA, pp. 417\u2013426 (1992)","DOI":"10.1109\/SFCS.1992.267748"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-45414-4_19","volume-title":"Distributed Computing","author":"L. Barriere","year":"2001","unstructured":"Barriere, L., Fraigniaud, P., Kranakis, E., Krizanc, D.: Efficient Routing in Networks with Long Range Contacts. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 270\u2013284. Springer, Heidelberg (2001)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"56122","DOI":"10.1103\/PhysRevE.70.056122","volume":"70","author":"M. Boguna","year":"2004","unstructured":"Boguna, M., Pastor\u2013Satorras, R., Diaz\u2013Guilera, A., Arenas, A.: Models of social networks based on social distance attachment. Phys. Rev. E\u00a070, 056122 (2004)","journal-title":"Phys. Rev. E"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Elkin, M.: Computing almost shortest paths. In: Proceedings of the 20th ACM Symposium on Principles of Distributed Computing, Newport, RI, August, pp. 53\u201363 (2001)","DOI":"10.1145\/383962.383983"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C.: Polylogarithmic Network Navigability Using Compact Metrics with Small Stretch. In: SPAA 2008: Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures, pp. 62\u201369. ACM, New York (2008)","DOI":"10.1145\/1378533.1378542"},{"key":"11_CR6","first-page":"1","volume-title":"Proceedings of the Nineteenth Annual ACM Symp. on Parallel Algorithms and Architectures","author":"P. Fraigniaud","year":"2007","unstructured":"Fraigniaud, P., Gavoille, C., Kosowski, A., Lebhar, E., Lotker, Z.: Universal Augmentation Schemes for Network Navigability: Overcoming the sqrt(n)\u2013Barrier. In: Proceedings of the Nineteenth Annual ACM Symp. on Parallel Algorithms and Architectures, pp. 1\u20137. ACM, New York (2007)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1038\/35022643","volume":"406","author":"J.M. Kleinberg","year":"2000","unstructured":"Kleinberg, J.M.: Navigation in a small world. Nature\u00a0406, 845 (2000)","journal-title":"Nature"},{"key":"11_CR8","volume-title":"Probability and statistics","author":"H. Lass","year":"1971","unstructured":"Lass, H., Gottlieb, P.: Probability and statistics. Addison-Wesley, Reading (1971)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"11623","DOI":"10.1073\/pnas.0503018102","volume":"102","author":"D. Liben\u2013Nowell","year":"2005","unstructured":"Liben\u2013Nowell, D., Novak, J., Kumar, R., Raghavan, P., Tomkins, A.: Geographical routing in social networks. Proceedings of the National Academy of Science\u00a0102, 11623\u201311628 (2005)","journal-title":"Proceedings of the National Academy of Science"},{"key":"11_CR10","first-page":"179","volume-title":"PODC 2004: Proceedings of the twentythird annual ACM symposium on Principles of distributed computing","author":"C. Martel","year":"2004","unstructured":"Martel, C., Nguyen, V.: Analyzing kleinberg\u2019s (and other) small-world models. In: PODC 2004: Proceedings of the twentythird annual ACM symposium on Principles of distributed computing, pp. 179\u2013188. ACM Press, New York (2004)"},{"key":"11_CR11","first-page":"60","volume":"2","author":"S. Milgram","year":"1967","unstructured":"Milgram, S.: The small world problem. Psychology Today\u00a02, 60\u201367 (1967)","journal-title":"Psychology Today"},{"key":"11_CR12","first-page":"161","volume":"6","author":"M. Molloy","year":"1995","unstructured":"Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence, Random Struct. Algorithms\u00a06, 161\u2013179 (1995)","journal-title":"Algorithms"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"26118","DOI":"10.1103\/PhysRevE.64.026118","volume":"64","author":"M.E.J. Newman","year":"2001","unstructured":"Newman, M.E.J., Strogatz, S.H., Watts, D.J.: Random graphs with arbitrary degree distributions and their applications, Phys. Phys. Rev. E\u00a064, 026118 (2001)","journal-title":"Phys. Rev. E"},{"key":"11_CR14","volume-title":"Probability theory, basic concepts. Limit theorems, random processes","author":"Y.V. Prohorov","year":"1969","unstructured":"Prohorov, Y.V., Rozanov, Y.A.: Probability theory, basic concepts. Limit theorems, random processes. Springer, Heidelberg (1969) (Translated from Russian)"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10687-006-7963-z","volume":"8","author":"H. Esker van den","year":"2006","unstructured":"van den Esker, H., van der Hofstad, R., Hooghiemstra, G., Znamenski, D.: Distances in random graphs with infinite mean degrees. Extremes\u00a08, 111\u2013140 (2006)","journal-title":"Extremes"}],"container-title":["Lecture Notes in Computer Science","Stochastic Algorithms: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04944-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T18:51:12Z","timestamp":1552157472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04944-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642049439","9783642049446"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04944-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}