{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:15:35Z","timestamp":1725549335045},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540234272"},{"type":"electronic","value":"9783540302162"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-30216-2_2","type":"book-chapter","created":{"date-parts":[[2010,2,28]],"date-time":"2010-02-28T23:39:11Z","timestamp":1267400351000},"page":"19-30","source":"Crossref","is-referenced-by-count":3,"title":["Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Reid","family":"Andersen","sequence":"first","affiliation":[]},{"given":"Fan","family":"Chung","sequence":"additional","affiliation":[]},{"given":"Lincoln","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Andersen, R., Chung, F., Lu, L.: Modelling the small world phenomenon using local network flow (Preprint)","key":"2_CR1"},{"doi-asserted-by":"crossref","unstructured":"Boyles, S., Exoo, G.: On line disjoint paths of bounded length. Discrete Math.\u00a044 (1983)","key":"2_CR2","DOI":"10.1016\/0012-365X(83)90197-8"},{"doi-asserted-by":"crossref","unstructured":"Chung, F., Lu, L.: Average distances in random graphs with given expected degree sequences. Proceedings of National Academy of Science\u00a099 (2002)","key":"2_CR3","DOI":"10.1073\/pnas.252631999"},{"unstructured":"Chung, F., Lu, L.: The small world phenomenon in hybrid power law graphs. Lecture Note in Physics, special volume on Complex Network (to appear)","key":"2_CR4"},{"key":"2_CR5","first-page":"264","volume":"11","author":"P. Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P., Gallai, T.: Gr\u00e1fok el\u0151\u00edrt fok\u00fa pontokkal (Graphs with points of prescribed degrees, in Hungarian). Mat. Lapok\u00a011, 264\u2013274 (1961)","journal-title":"Mat. Lapok"},{"doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Koutsoupias, E., Papadimitriou, C.H.: Heuristically optimized trade-offs: a new paradigm for power laws in the Internet. In: STOC 2002 (2002)","key":"2_CR6","DOI":"10.1007\/3-540-45465-9_11"},{"unstructured":"Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K.: Graph Clustering and Minimum Cut Trees","key":"2_CR7"},{"unstructured":"Garg, N., Konemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. Technical Report, Max-Planck-Institut fur Informatik, Saarbrucken, Germany (1997)","key":"2_CR8"},{"doi-asserted-by":"crossref","unstructured":"Itai, A., Perl, Y., Shiloach, Y.: The complexity of finding maximum disjoint paths with length constraints. Networks\u00a012 (1982)","key":"2_CR9","DOI":"10.1002\/net.3230120306"},{"doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proc. 32nd ACM Symposium on Theory of Computing (2000)","key":"2_CR10","DOI":"10.1145\/335305.335325"},{"key":"2_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"},{"doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: A Brief History of Generative Models for Power Law and Lognormal Distributions. Internet Math.\u00a01(2) (2003)","key":"2_CR12","DOI":"10.1080\/15427951.2004.10129088"},{"doi-asserted-by":"crossref","unstructured":"Plotkin, S., Shmoys, D.B., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. In: FOCS 1991, pp. 495\u2013504 (1991)","key":"2_CR13","DOI":"10.1109\/SFCS.1991.185411"},{"doi-asserted-by":"crossref","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small world\u2019 networks. Nature\u00a0393, 440\u2013442","key":"2_CR14","DOI":"10.1038\/30918"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web-Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30216-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T13:16:25Z","timestamp":1558876585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30216-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540234272","9783540302162"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30216-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}