{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T18:53:06Z","timestamp":1780426386107,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,8,11]]},"DOI":"10.1145\/1159913.1159930","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T18:04:00Z","timestamp":1161194640000},"page":"135-146","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":91,"title":["Systematic topology analysis and generation using degree correlations"],"prefix":"10.1145","author":[{"given":"Priya","family":"Mahadevan","sequence":"first","affiliation":[{"name":"UC San Diego"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dmitri","family":"Krioukov","sequence":"additional","affiliation":[{"name":"CAIDA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kevin","family":"Fall","sequence":"additional","affiliation":[{"name":"Intel Research"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amin","family":"Vahdat","sequence":"additional","affiliation":[{"name":"UC San Diego"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335326"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.036112"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2004-00038-8"},{"key":"e_1_3_2_1_4_1","volume-title":"INFOCOM","author":"Bu T.","year":"2002","unstructured":"T. Bu and D. Towsley . On distinguishing between Internet power law topology generators . In INFOCOM 2002 . T. Bu and D. Towsley. On distinguishing between Internet power law topology generators. In INFOCOM 2002."},{"key":"e_1_3_2_1_5_1","unstructured":"CAIDA. Macroscopic topology AS adjacencies. http:\/\/www.caida.org\/tools\/measurement\/skitter\/asadjacencies.xml  CAIDA. Macroscopic topology AS adjacencies. http:\/\/www.caida.org\/tools\/measurement\/skitter\/asadjacencies.xml"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.236"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00012580"},{"key":"e_1_3_2_1_8_1","series-title":"Regional Conference Series in Mathematics American Mathematical Society","volume-title":"Spectral Graph Theory","author":"Chung F. K. R.","year":"1997","unstructured":"F. K. R. Chung . Spectral Graph Theory volume 92 of Regional Conference Series in Mathematics American Mathematical Society , Providence , RI , 1997 . F. K. R. Chung. Spectral Graph Theory volume 92 of Regional Conference Series in Mathematics American Mathematical Society, Providence, RI, 1997."},{"key":"e_1_3_2_1_9_1","unstructured":"S. N. Dorogovtsev. Networks with given correlations. http:\/\/arxiv.org\/abs\/cond-mat\/0308336v1  S. N. Dorogovtsev. Networks with given correlations. http:\/\/arxiv.org\/abs\/cond-mat\/0308336v1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.027104"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1212782"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"Erd\u00f3s P.","year":"1959","unstructured":"P. Erd\u00f3s and A. R\u00e9nyi . On random graphs . Publicationes Mathematicae 6 : 290 -- 297 , 1959 . P. Erd\u00f3s and A. R\u00e9nyi. On random graphs. Publicationes Mathematicae 6:290--297, 1959.","journal-title":"Publicationes Mathematicae"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316229"},{"key":"e_1_3_2_1_14_1","volume-title":"ESA","author":"Fraigniaud P.","year":"2005","unstructured":"P. Fraigniaud . A new perspective on the small-world phenomenon: Greedy routing in tree-decomposed graphs . In ESA 2005 . P. Fraigniaud. A new perspective on the small-world phenomenon: Greedy routing in tree-decomposed graphs. In ESA 2005."},{"key":"e_1_3_2_1_15_1","volume-title":"ALENEX","author":"Gkantsidis C.","year":"2003","unstructured":"C. Gkantsidis , M. Mihail , and E. Zegura . The Markov simulation method for generating connected power law random graphs . In ALENEX 2003 . C. Gkantsidis, M. Mihail, and E. Zegura. The Markov simulation method for generating connected power law random graphs. In ALENEX 2003."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.930936"},{"key":"e_1_3_2_1_17_1","unstructured":"Internet Routing Registries. http:\/\/www.irr.net\/.  Internet Routing Registries. http:\/\/www.irr.net\/."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354495"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015470"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111328"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2003.06.002"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/882459.882563"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240060204"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.89.208701"},{"key":"e_1_3_2_1_26_1","unstructured":"University of Oregon RouteViews Project. http:\/\/www.routeviews.org\/.  University of Oregon RouteViews Project. http:\/\/www.routeviews.org\/."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.036133"},{"key":"e_1_3_2_1_28_1","volume-title":"The On-Line Encyclopedia of Integer Sequences","author":"Sloane N. J. A.","unstructured":"N. J. A. Sloane . Sequence A001349. The On-Line Encyclopedia of Integer Sequences . http:\/\/www.research.att.com\/projects\/OEIS?Anum=A001349 N. J. A. Sloane. Sequence A001349. The On-Line Encyclopedia of Integer Sequences. http:\/\/www.research.att.com\/projects\/OEIS?Anum=A001349"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633040"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.066130"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/2958119.2958125"}],"event":{"name":"SIGCOMM06: ACM SIGCOMM 2006 Conference","location":"Pisa Italy","acronym":"SIGCOMM06","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1159913.1159930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T08:36:31Z","timestamp":1693816591000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1159913.1159930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,11]]},"references-count":31,"alternative-id":["10.1145\/1159913.1159930","10.1145\/1159913"],"URL":"https:\/\/doi.org\/10.1145\/1159913.1159930","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1151659.1159930","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2006,8,11]]},"assertion":[{"value":"2006-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}