{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:11:33Z","timestamp":1725570693236},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176524"},{"type":"electronic","value":"9783642176531"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17653-1_3","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T05:50:47Z","timestamp":1291614647000},"page":"32-47","source":"Crossref","is-referenced-by-count":1,"title":["Biased Selection for Building Small-World Networks"],"prefix":"10.1007","author":[{"given":"Andr\u00e9s","family":"Sevilla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Mozo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Araceli","family":"Lorenzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose Luis","family":"L\u00f3pez-Presa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pilar","family":"Manzano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Fern\u00e1ndez Anta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_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":"3_CR2","first-page":"135","volume-title":"EDCC","author":"M. Bertier","year":"2010","unstructured":"Bertier, M., Bonnet, F., Kermarrec, A.-M., Leroy, V., Peri, S., Raynal, M.: D2ht: The best of both worlds, integrating rps and dht. In: EDCC, pp. 135\u2013144. IEEE Computer Society, Los Alamitos (2010)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-77096-1_27","volume-title":"Principles of Distributed Systems","author":"F. Bonnet","year":"2007","unstructured":"Bonnet, F., Kermarrec, A.-M., Raynal, M.: Small-world networks: From theoretical bounds to practical systems. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol.\u00a04878, pp. 372\u2013385. Springer, Heidelberg (2007)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/11864219_45","volume-title":"Distributed Computing","author":"F. Bonnet","year":"2006","unstructured":"Bonnet, F., Tronel, F., Voulgaris, S.: Brief announcement: Performance analysis of cyclon, an inexpensive membership management for unstructured P2P overlays. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 560\u2013562. Springer, Heidelberg (2006)"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/1148109.1148145","volume-title":"SPAA","author":"P. Duchon","year":"2006","unstructured":"Duchon, P., Hanusse, N., Lebhar, E., Schabanel, N.: Towards small world emergence. In: Gibbons, P.B., Vishkin, U. (eds.) SPAA, pp. 225\u2013232. ACM, New York (2006)"},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00446-005-0137-4","volume":"18","author":"P. Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Gavoille, C., Paul, C.: Eclecticism shrinks even small worlds. Distributed Computing\u00a018(4), 279\u2013291 (2006)","journal-title":"Distributed Computing"},{"key":"3_CR7","first-page":"389","volume-title":"STOC","author":"P. Fraigniaud","year":"2010","unstructured":"Fraigniaud, P., Giakkoupis, G.: On the searchability of small-world networks with arbitrary underlying structure. In: Schulman, L.J. (ed.) STOC, pp. 389\u2013398. ACM, New York (2010)"},{"key":"3_CR8","first-page":"749","volume":"7","author":"S. Gerschgorin","year":"1931","unstructured":"Gerschgorin, S.: \u00dcber die abgrenzung der eigenwerte einer matrix. Izv. Akad. Nauk. USSR Otd. Fiz.-Mat. Nauk.\u00a07, 749\u2013754 (1931)","journal-title":"Izv. Akad. Nauk. USSR Otd. Fiz.-Mat. Nauk."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: Gossip-based peer sampling. ACM Trans. Comput. Syst.\u00a025(3) (2007)","DOI":"10.1145\/1275517.1275520"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: Navigation in a small world. Nature 406(6798) (August 2000)","DOI":"10.1038\/35022643"},{"key":"3_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"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"A. Sinclair","year":"1989","unstructured":"Sinclair, A., Jerrum, M.: Approximate counting, uniform generation and rapidly mixing markov chains. Inf. Comput.\u00a082(1), 93\u2013133 (1989)","journal-title":"Inf. Comput."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Voulgaris, S., Gavidia, D., van Steen, M.: Cyclon: Inexpensive membership management for unstructured P2P overlays. J. Network Syst. Manage.\u00a013(2) (2005)","DOI":"10.1007\/s10922-005-4441-x"},{"issue":"6684","key":"3_CR14","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 \u2019small-world\u2019 networks. Nature\u00a0393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: On constructing minimum spanning trees in k-dimensional space and related problems. SIAM Journal of Computing (1982)","DOI":"10.1137\/0211059"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17653-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T20:24:14Z","timestamp":1712003054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17653-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176524","9783642176531"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17653-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}