{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T04:20:22Z","timestamp":1777177222873,"version":"3.51.4"},"reference-count":28,"publisher":"Oxford University Press (OUP)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jcomplexnetw"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1093\/comnet\/cnv013","type":"journal-article","created":{"date-parts":[[2015,6,11]],"date-time":"2015-06-11T05:25:08Z","timestamp":1434000308000},"page":"15-37","source":"Crossref","is-referenced-by-count":26,"title":["Efficient and simple generation of random simple connected graphs with prescribed degree sequence"],"prefix":"10.1093","volume":"4","author":[{"given":"Fabien","family":"Viger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthieu","family":"Latapy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2015,6,9]]},"reference":[{"key":"2016022507474423000_4.1.15.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\u00f6s","year":"1959","journal-title":"Publ. Math. Debrecen"},{"key":"2016022507474423000_4.1.15.2","unstructured":"Bollobas B. (1985) Random Graphs. London: Academic Press."},{"key":"2016022507474423000_4.1.15.3","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"2016022507474423000_4.1.15.4","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"2016022507474423000_4.1.15.5","doi-asserted-by":"publisher","DOI":"10.1080\/00018730110112519"},{"key":"2016022507474423000_4.1.15.6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.026118"},{"key":"2016022507474423000_4.1.15.7","doi-asserted-by":"crossref","first-page":"21:1","DOI":"10.1145\/1538902.1538905","article-title":"On the bias of traceroute sampling: Or, powerlaw degree distributions in regular graphs","volume":"56","author":"Achlioptas","year":"2009","journal-title":"J. ACM"},{"key":"2016022507474423000_4.1.15.8","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316229"},{"key":"2016022507474423000_4.1.15.9","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90059-6"},{"key":"2016022507474423000_4.1.15.10","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548398003526"},{"key":"2016022507474423000_4.1.15.11","doi-asserted-by":"crossref","unstructured":"Aiello W. Chung F. Lu L. (2000) A random graph model for massive graphs. Proceedings of the 32nd ACM STOC, Portland, OR, USA, pp. 171\u2013180.","DOI":"10.1145\/335305.335326"},{"key":"2016022507474423000_4.1.15.12","first-page":"225","article-title":"A markov chain monte carlo method for generating random (0,1)-matrices with given marginals","volume":"58(A)","author":"Rao","year":"1996","journal-title":"Indian J. Stat."},{"key":"2016022507474423000_4.1.15.13","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(00)00026-5"},{"key":"2016022507474423000_4.1.15.14","article-title":"Uniform generation of random graphs with arbitrary degree sequences","author":"Milo","year":"2003"},{"key":"2016022507474423000_4.1.15.15","unstructured":"Gkantsidis C. Mihail M. Zegura E. (2003) The markov chain simulation method for generating connected power law random graphs. Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, Baltimore, MD, USA, pp. 16\u201325."},{"key":"2016022507474423000_4.1.15.16","unstructured":"https:\/\/www-complexnetworks.lip6.fr\/~latapy\/FV\/generation.html ."},{"key":"2016022507474423000_4.1.15.17","first-page":"496","article-title":"A remark on the existence of finite graphs","volume":"80","author":"Havel","year":"1955","journal-title":"Caposis Pest. Mat."},{"key":"2016022507474423000_4.1.15.18","first-page":"496","article-title":"On the realizability of a set of integers as degrees of the vertices of a linear graph","volume":"10","author":"Hakimi","year":"1962","journal-title":"SIAM J."},{"key":"2016022507474423000_4.1.15.19","first-page":"264","article-title":"Graphs with prescribed degree of vertices","volume":"11","author":"Erdos","year":"1960","journal-title":"Mat. Lapok"},{"key":"2016022507474423000_4.1.15.20","first-page":"314","article-title":"Constrained switchings in graphs","volume":"8","author":"Taylor","year":"1980","journal-title":"Combin. Math."},{"key":"2016022507474423000_4.1.15.21","doi-asserted-by":"publisher","DOI":"10.1137\/0218077"},{"key":"2016022507474423000_4.1.15.22","doi-asserted-by":"crossref","unstructured":"Feder T. Guetz A. Mihail M. Saberi A. (2006) A local switch markov chain on given degree graphs with application in connectivity of peer-to-peer networks. FOCS, pp. 69\u201376. IEEE Computer Society.","DOI":"10.1109\/FOCS.2006.5"},{"key":"2016022507474423000_4.1.15.23","doi-asserted-by":"publisher","DOI":"10.1145\/320211.320215"},{"key":"2016022507474423000_4.1.15.24","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502095"},{"key":"2016022507474423000_4.1.15.25","doi-asserted-by":"crossref","unstructured":"Thorup M. (2000) Near-optimal fully-dynamic graph connectivity. Proceedings of the 32nd ACM STOC, Portland, OR, USA, pp. 343\u2013350.","DOI":"10.1145\/335305.335345"},{"key":"2016022507474423000_4.1.15.26","article-title":"A study of the edge-switching markov-chain method for the generation of random graphs","author":"Alexandre","year":"2006"},{"key":"2016022507474423000_4.1.15.27","doi-asserted-by":"publisher","DOI":"10.1145\/1963190.1963191"},{"key":"2016022507474423000_4.1.15.28","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240060204"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/4\/1\/15\/6999929\/cnv013.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T09:26:28Z","timestamp":1691745988000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article-lookup\/doi\/10.1093\/comnet\/cnv013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,9]]},"references-count":28,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2016,2,25]]},"published-print":{"date-parts":[[2016,3]]}},"alternative-id":["10.1093\/comnet\/cnv013"],"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnv013","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"value":"2051-1310","type":"print"},{"value":"2051-1329","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,9]]}}}