{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:08Z","timestamp":1725558848893},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_2","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"12-17","source":"Crossref","is-referenced-by-count":2,"title":["Drawing Power Law Graphs"],"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":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lu, L.: Analyzing the small world phenomenon using a hybrid model with local network flow. In: Proceedings of the Third Workshop on Algorithms and Models for the Web-Graph (2004)","DOI":"10.1007\/978-3-540-30216-2_2"},{"key":"2_CR2","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, 99 (2002)","DOI":"10.1073\/pnas.252631999"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Chung, F., Lu, L.: The small world phenomenon in hybrid power law graphs Complex Networks. Ben-Naim, E., et al. (eds.). Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-44485-5_4"},{"key":"2_CR4","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)","DOI":"10.1007\/3-540-45465-9_11"},{"key":"2_CR5","unstructured":"Garg, N., K\u00f6nemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: Technical Report, Max-Planck-Institut fur Informatik, Saarbrucken, Germany (1997)"},{"key":"2_CR6","unstructured":"Grossman, J., Ion, P., De Castro, R.: Facts about Erd\u00f6s Numbers and the Collaboration Graph, http:\/\/www.oakland.edu\/~grossman\/trivia.html."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proc. 32nd ACM Symposium on Theory of Computing (2000)","DOI":"10.1145\/335305.335325"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: A Brief History of Generative Models for Power Law and Lognormal Distributions. Internet Math.\u00a01(2) (2003)","DOI":"10.1080\/15427951.2004.10129088"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:28:14Z","timestamp":1605760094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}