{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:04Z","timestamp":1725474964354},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_34","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:57:35Z","timestamp":1164761855000},"page":"328-338","source":"Crossref","is-referenced-by-count":1,"title":["How Much Independent Should Individual Contacts Be to Form a Small\u2013World?"],"prefix":"10.1007","author":[{"given":"Gennaro","family":"Cordasco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","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. Barri\u00e8re","year":"2001","unstructured":"Barri\u00e8re, 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":"34_CR2","volume-title":"Proc. I-SPAN 2005","author":"G. Chiola","year":"2005","unstructured":"Chiola, G., Cordasco, G., Gargano, L., Negro, A., Scarano, V.: Overlay networks with class. In: Proc. I-SPAN 2005, IEEE Press, Los Alamitos (2005)"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1098\/rspa.1997.0126","volume":"A453","author":"J.H. Conway","year":"1997","unstructured":"Conway, J.H., Sloane, N.J.A.: Low Dimensional Lattices VII: Coordination Sequences. Proc. Royal Soc.\u00a0A453, 2369\u20132389 (1997)","journal-title":"Proc. Royal Soc."},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1126\/science.1081058","volume":"301","author":"P.S. Dodds","year":"2003","unstructured":"Dodds, P.S., Muhamad, R., Watts, D.J.: An Experimental study of Search in Global Social Networks Ca2\u2009+\u2009. Science\u00a0301, 827\u2013829 (2003)","journal-title":"Science"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: The Small\u2013World Phenomenon: An Algorithm Perspective. In: Proc. of 32th ACM Symp. on Theory of computing (STOC 2000), pp. 163\u2013170 (May 2000)","DOI":"10.1145\/335305.335325"},{"key":"34_CR6","unstructured":"Kleinberg, J.M.: The Small\u2013World Phenomena and the Dynamics of informations. In: Advances in Neural Information Processing Systems (NIPS) (December 2001)"},{"key":"34_CR7","unstructured":"Kleinberg, J.M.: Complex Networks and Decentralized Search Algorithms. In: International Congress of Mathematicians (ICM) (2006)"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C., Paul, C.: Eclecticism Shrinks Even Small Worlds. In: PODC 2004 (2004)","DOI":"10.1145\/1011767.1011793"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-Theoretic, Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience. In: Proc. of the ACM SIGCOMM 2003 Conference (2003)","DOI":"10.1145\/863955.863999"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Milgram, S.: The Small World Problem. Psychology Today, 60\u201367 (May 1967)","DOI":"10.1037\/e400002009-005"},{"key":"34_CR11","unstructured":"Manku, G.S., Bawa, M., Raghavan, P.: Symphony: Distributed hashing in a Small World. In: Proc. of USENIX Symp. on Internet Technologies and Systems (USITS) (March 2003)"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Naor, M., Wieder, U.: Know thy Neighbor\u2019s Neighbor: The Power of Lookahead in Randomized P2P Networks. In: Proceedings of 36th ACM Symp. on Theory of Computing (STOC 2004), pp. 54\u201363 (June 2004)","DOI":"10.1145\/1007352.1007368"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Martel, C., Van Nguyen: Analyzing Kleinberg\u2019s (and other) Small\u2013world models. In: The 23rd ACM Symposium on Principles of Distributed Computing, pp. 179\u2013188 (2004)","DOI":"10.1145\/1011767.1011794"},{"key":"34_CR14","unstructured":"Newth, D., Ash, J.: Evolving cascading failure resilience in complex networks. In: Proc. of 8th Asia Pacific Symp. on Intelligent and Evolutionary Systems (December 2004)"},{"issue":"1","key":"34_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","unstructured":"Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications. IEEE\/ACM Trans. Networking\u00a011(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"34_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 \u2018smallworld\u2019 networks. Nature\u00a0393, 440\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:49:53Z","timestamp":1619495393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11940128_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}