{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:14Z","timestamp":1750307414814,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806744","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"389-398","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["On the searchability of small-world networks with arbitrary underlying structure"],"prefix":"10.1145","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[{"name":"CNRS and Univ. Paris Diderot, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Giakkoupis","sequence":"additional","affiliation":[{"name":"CNRS and Univ. Paris Diderot, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146411"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536494"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1081058"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_46"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_70"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248379"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011793"},{"key":"e_1_3_2_1_8_1","volume-title":"13th ESA","author":"Fraigniaud P.","year":"2006","unstructured":"P. Fraigniaud , E. Lebhar , and Z. Lotker . A lower bound for network navigability. SIAM J. Discrete Math., to appear. (Preliminary version in phProc . 13th ESA , 2006 .). P. Fraigniaud, E. Lebhar, and Z. Lotker. A lower bound for network navigability. SIAM J. Discrete Math., to appear. (Preliminary version in phProc. 13th ESA, 2006.)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"e_1_3_2_1_10_1","first-page":"431","volume-title":"Proc. 15th Neural Information Processing Systems Conf. (NIPS)","author":"Kleinberg J.","year":"2001","unstructured":"J. Kleinberg . Small-world phenomena and the dynamics of information . In Proc. 15th Neural Information Processing Systems Conf. (NIPS) , pages 431 -- 438 , 2001 . J. Kleinberg. Small-world phenomena and the dynamics of information. In Proc. 15th Neural Information Processing Systems Conf. (NIPS), pages 431--438, 2001."},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. Int. Congress of Mathematicians (ICM)","author":"Kleinberg J.","year":"2006","unstructured":"J. Kleinberg . Complex networks and decentralized search algorithms . In Proc. Int. Congress of Mathematicians (ICM) , 2006 . J. Kleinberg. Complex networks and decentralized search algorithms. In Proc. Int. Congress of Mathematicians (ICM), 2006."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_75"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0503018102"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007368"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011794"},{"key":"e_1_3_2_1_16_1","first-page":"311","volume-title":"Proc. 16th ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Martel C.","year":"2005","unstructured":"C. Martel and V. Nguyen . Analyzing and characterizing small-world graphs . In Proc. 16th ACM-SIAM Symp. on Discrete Algorithms (SODA) , pages 311 -- 320 , 2005 . C. Martel and V. Nguyen. Analyzing and characterizing small-world graphs. In Proc. 16th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 311--320, 2005."},{"issue":"1","key":"e_1_3_2_1_17_1","first-page":"60","article-title":"The small world problem","volume":"67","author":"Milgram S.","year":"1967","unstructured":"S. Milgram . The small world problem . Psychology Today , 67 ( 1 ): 60 -- 67 , 1967 . S. Milgram. The small world problem. Psychology Today, 67(1):60--67, 1967.","journal-title":"Psychology Today"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073823"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"}],"event":{"name":"STOC'10: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge Massachusetts USA","acronym":"STOC'10"},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806744","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806744","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806744"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":19,"alternative-id":["10.1145\/1806689.1806744","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806744","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}