{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T06:57:35Z","timestamp":1722409055675},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,10,18]],"date-time":"2007-10-18T00:00:00Z","timestamp":1192665600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1007\/s00224-007-9073-y","type":"journal-article","created":{"date-parts":[[2007,10,17]],"date-time":"2007-10-17T14:42:01Z","timestamp":1192632121000},"page":"632-650","source":"Crossref","is-referenced-by-count":4,"title":["Asymptotically Optimal Solutions for Small World Graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Michele","family":"Flammini","sequence":"first","affiliation":[]},{"given":"Luca","family":"Moscardelli","sequence":"additional","affiliation":[]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[]},{"given":"St\u00e9phane","family":"P\u00e9rennes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,18]]},"reference":[{"key":"9073_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/3-540-48155-9_27","volume-title":"Proc. of the 3rd European Conference on Research and Advanced Technology for DIGITAL LIBRARIES (ECDL)","author":"L.A. Adamic","year":"1999","unstructured":"Adamic, L.A.: The small world web. In: Proc. of the 3rd European Conference on Research and Advanced Technology for DIGITAL LIBRARIES (ECDL). Lecture Notes in Computer Science, vol. 1696, pp. 443\u2013452. Springer, New York (1999)"},{"key":"9073_CR2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/571825.571862","volume-title":"Proc. of the 21st Annual Symposium on Principles of Distributed Computing (PODC)","author":"J. Aspnes","year":"2002","unstructured":"Aspnes, J., Diamadi, Z., Shah, G.: Fault-tolerant routing in peer-to-peer systems. In: Proc. of the 21st Annual Symposium on Principles of Distributed Computing (PODC), pp. 223\u2013232. ACM Press, New York (2002)"},{"key":"9073_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/3-540-45414-4_19","volume-title":"Proc. of the 15th International Conference on Distributed Computing (DISC)","author":"L. Barriere","year":"2001","unstructured":"Barriere, L., Fraigniaud, P., Kranakis, E., Krizanc, D.: Efficient routing in networks with long range contacts. In: Proc. of the 15th International Conference on Distributed Computing (DISC). Lecture Notes in Computer Science, vol.\u00a02180, pp. 270\u2013284. Springer, Berlin (2001)"},{"key":"9073_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1007\/11561071_70","volume-title":"Proceedings of the 13th Annual European Symposium on Algorithms (ESA)","author":"P. Fraigniaud","year":"2005","unstructured":"Fraigniaud, P.: Greedy routing in tree-decomposed graphs. In: Proceedings of the 13th Annual European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol.\u00a03669, pp. 791\u2013802. Springer, Berlin (2005)"},{"key":"9073_CR5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1145\/1011767.1011793","volume-title":"Proc. of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"P. Fraigniaud","year":"2004","unstructured":"Fraigniaud, P., Gavoille, C., Paul, C.: Eclecticism shrinks even small worlds. In: Proc. of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 169\u2013178. ACM Press, New York (2004)"},{"key":"9073_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"9073_CR7","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: Small-world phenomena and the dynamics of information. In: Proc. of the 14th Advances in Neural Information Processing Systems (NIPS) (2001)","DOI":"10.7551\/mitpress\/1120.003.0060"},{"key":"9073_CR8","first-page":"3","volume":"37","author":"J. Kleinberg","year":"2004","unstructured":"Kleinberg, J.: The small-world phenomenon and decentralized search. SIAM News 37, 3 (2004)","journal-title":"SIAM News"},{"key":"9073_CR9","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: The small-world phenomenon: an algorithm perspective. In: Proc. of the 32nd ACM Symposium on Theory of Computing (STOC), pp. 163\u2013170 (2000)","DOI":"10.1145\/335305.335325"},{"key":"9073_CR10","doi-asserted-by":"crossref","unstructured":"Martel, C., Nguyen, V.: Analyzing Kleinberg\u2019s (and other) small-world models. In: Proc. of the 23rd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pp. 179\u2013188 (2004)","DOI":"10.1145\/1011767.1011794"},{"key":"9073_CR11","unstructured":"Martel, C., Nguyen, V.: Analyzing and characterizing small-world graphs. In: Proc. of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 311\u2013320 (2005)"},{"key":"9073_CR12","first-page":"60","volume":"2","author":"S. Milgram","year":"1967","unstructured":"Milgram, S.: The small world problem. Psychol. Today 2, 60\u201367 (1967)","journal-title":"Psychol. Today"},{"key":"9073_CR13","unstructured":"Walsh, T.: Search in a small world. In: Proc. of the 16th International Joint Conference on Artificial Intelligence (IJCAI), pp. 1172\u20131177 (1999)"},{"issue":"1","key":"9073_CR14","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/MCAS.2003.1228503","volume":"3","author":"X.F. Wang","year":"2003","unstructured":"Wang, X.F., Chen, G.: Complex networks: small-world, scale-free, and beyond. IEEE Circ. Syst. Mag. 3(1), 6\u201320 (2003)","journal-title":"IEEE Circ. Syst. Mag."},{"issue":"2","key":"9073_CR15","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1086\/210318","volume":"105","author":"D.J. Watts","year":"1999","unstructured":"Watts, D.J., Strogatz, S.H.: Networks, dynamics and small-world phenomenon. Am. J. Soc. 105(2), 493\u2013527 (1999)","journal-title":"Am. J. Soc."},{"issue":"1","key":"9073_CR16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1145\/510726.510753","volume":"32","author":"H. Zhang","year":"2002","unstructured":"Zhang, H., Goel, A., Govindan, R.: Using the small-world model to improve freenet performance. SIGCOMM Comput. Commun. Rev. 32(1), 79\u201379 (2002)","journal-title":"SIGCOMM Comput. Commun. Rev."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9073-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9073-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9073-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T14:28:17Z","timestamp":1708266497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9073-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,18]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["9073"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9073-y","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,18]]}}}