{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:59:28Z","timestamp":1725569968247},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291633"},{"type":"electronic","value":"9783540320753"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11561927_30","type":"book-chapter","created":{"date-parts":[[2005,10,10]],"date-time":"2005-10-10T14:14:47Z","timestamp":1128953687000},"page":"414-428","source":"Crossref","is-referenced-by-count":16,"title":["Asymptotically Optimal Solutions for Small World Graphs"],"prefix":"10.1007","author":[{"given":"Michele","family":"Flammini","sequence":"first","affiliation":[]},{"given":"Luca","family":"Moscardelli","sequence":"additional","affiliation":[]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[]},{"given":"Stephane","family":"Perennes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/3-540-48155-9_27","volume-title":"Research and Advanced Technology for Digital Libraries","author":"L.A. Adamic","year":"1999","unstructured":"Adamic, L.A.: The Small World Web. In: Abiteboul, S., Vercoustre, A.-M. (eds.) ECDL 1999. LNCS, vol.\u00a01696, pp. 443\u2013452. Springer, Heidelberg (1999)"},{"key":"30_CR2","doi-asserted-by":"publisher","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":"30_CR3","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":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_70","volume-title":"Algorithms \u2013 ESA 2005","author":"P. Fraigniaud","year":"2005","unstructured":"Fraigniaud, P.: A new perspective on the small-world phenomenon: Greedy routing in tree-decomposed graphs. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669. Springer, Heidelberg (2005)"},{"key":"30_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":"30_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. W.H. Freeman and Co., New York (1979)"},{"key":"30_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":"30_CR8","unstructured":"Kleinberg, J.: The Small-World Phenomenon and Decentralized Search. SIAM News\u00a037(3) (2004)"},{"key":"30_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":"30_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":"30_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":"30_CR12","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":"30_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":"30_CR14","doi-asserted-by":"publisher","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 Circuits and Systems Magazine\u00a03(1), 6\u201320 (2003)","journal-title":"IEEE Circuits and Systems Magazine"},{"issue":"2","key":"30_CR15","doi-asserted-by":"publisher","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. American Journal of Sociology\u00a0105(2), 493\u2013527 (1999)","journal-title":"American Journal of Sociology"},{"issue":"1","key":"30_CR16","doi-asserted-by":"publisher","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 Computer Communication Review\u00a032(1), 79\u201379 (2002)","journal-title":"SIGCOMM Computer Communication Review"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561927_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:30:26Z","timestamp":1706650226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561927_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291633","9783540320753"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11561927_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}