{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:59:22Z","timestamp":1725569962800},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291633"},{"type":"electronic","value":"9783540320753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561927_46","type":"book-chapter","created":{"date-parts":[[2005,10,10]],"date-time":"2005-10-10T14:14:47Z","timestamp":1128953687000},"page":"511-513","source":"Crossref","is-referenced-by-count":7,"title":["Could any Graph be Turned into a Small-World?"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Duchon","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Hanusse","sequence":"additional","affiliation":[]},{"given":"Emmanuelle","family":"Lebhar","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Schabanel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"Milgram, S.: The small world problem. Psychology Today\u00a061 (1967)","DOI":"10.1037\/e400002009-005"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature\u00a0393 (1998)","DOI":"10.1038\/30918"},{"key":"46_CR3","first-page":"7332","volume":"60","author":"M.E.J. Newman","year":"1999","unstructured":"Newman, M.E.J., Watts, D.J.: Scaling and percolation in the small-world network model. Phys. Rev.\u00a060, 7332\u20137342 (1999)","journal-title":"Phys. Rev."},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. In: Proceedings of the 32nd ACM Symp. on Theory of Computing (STOC), pp. 163\u2013170 (2000)","DOI":"10.1145\/335305.335325"},{"key":"#cr-split#-46_CR5.1","doi-asserted-by":"crossref","unstructured":"Duchon, P., Hanusse, N., Lebhar, E., Schabanel, N.: Could any graph be turned into a small world? To appear in Theoretical Computer Science special issue on Complex Networks (2005);","DOI":"10.1007\/11561927_46"},{"key":"#cr-split#-46_CR5.2","unstructured":"Also available as Research Report LIP-RR2004-62"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561927_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:51:13Z","timestamp":1605642673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561927_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291633","9783540320753"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11561927_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}