{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:20:49Z","timestamp":1758817249874},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169250"},{"type":"electronic","value":"9783642169267"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16926-7_21","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T02:48:26Z","timestamp":1289357306000},"page":"220-231","source":"Crossref","is-referenced-by-count":16,"title":["Uniform Sampling of Digraphs with a Fixed Degree Sequence"],"prefix":"10.1007","author":[{"given":"Annabell","family":"Berger","sequence":"first","affiliation":[]},{"given":"Matthias","family":"M\u00fcller-Hannemann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Milo, R., Kashtan, N., Itzkovitz, S., Newman, M., Alon, U.: On the uniform generation of random graphs with arbitrary degree sequences, arXiv:cond-mat\/0312028v2 (May 30, 2004)"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.1126\/science.1089167","volume":"303","author":"R. Milo","year":"2004","unstructured":"Milo, R., Itzkovitz, S., Kashtan, N., Levitt, R., Shen-Orr, S., Ayzenshtat, I., Sheffer, M., Alon, U.: Superfamilies of evolved and designed networks. Science\u00a0303, 1538\u20131542 (2004)","journal-title":"Science"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1017\/S0963548300000390","volume":"1","author":"A. Sinclair","year":"1992","unstructured":"Sinclair, A.: Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probability & Computing\u00a01, 351\u2013370 (1992)","journal-title":"Combinatorics, Probability & Computing"},{"key":"21_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0323-0","volume-title":"Algorithms for Random Generation and Counting: A Markov Chain Approach","author":"A. Sinclair","year":"1993","unstructured":"Sinclair, A.: Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkh\u00e4user, Basel (1993)"},{"key":"21_CR5","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: A survey. In: D.M., et al. (eds.) Combinatorics, Paul Erd\u0151s is Eighty, vol.\u00a02, pp. 353\u2013397. J\u00e1nos Bolyai Mathematical Society (1996)"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"371","DOI":"10.4153\/CJM-1957-044-3","volume":"9","author":"H.J. Ryser","year":"1957","unstructured":"Ryser, H.J.: Combinatorial properties of matrices of zeroes and ones. Canadian J. of Mathematics\u00a09, 371\u2013377 (1957)","journal-title":"Canadian J. of Mathematics"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/0016-0032(66)90301-2","volume":"281","author":"W. Chen","year":"1966","unstructured":"Chen, W.: On the realization of a (p,s)-digraph with prescribed degrees. J. Franklin Institute\u00a0281, 406\u2013422 (1966)","journal-title":"J. Franklin Institute"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"W. Tutte","year":"1952","unstructured":"Tutte, W.: The factors of graphs. Canadian J. of Mathematics\u00a04, 314\u2013328 (1952)","journal-title":"Canadian J. of Mathematics"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0012-365X(73)90037-X","volume":"6","author":"D. Kleitman","year":"1973","unstructured":"Kleitman, D., Wang, D.: Algorithm for constructing graphs and digraphs with given valences and factors. Discrete Math.\u00a06, 79\u201388 (1973)","journal-title":"Discrete Math."},{"key":"21_CR10","doi-asserted-by":"crossref","first-page":"477","DOI":"10.21136\/CPM.1955.108220","volume":"80","author":"V. Havel","year":"1955","unstructured":"Havel, V.: A remark on the existence of finite graphs. \u010casopis P\u011bst. Mat.\u00a080, 477\u2013480 (1955)","journal-title":"\u010casopis P\u011bst. Mat."},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"S. Hakimi","year":"1962","unstructured":"Hakimi, S.: On the realizability of a set of integers as degrees of the vertices of a simple graph. SIAM J. Appl. Math.\u00a010, 496\u2013506 (1962)","journal-title":"SIAM J. Appl. Math."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0016-0032(65)90340-6","volume":"279","author":"S. Hakimi","year":"1965","unstructured":"Hakimi, S.: On the degrees of the vertices of a directed graph. J. Franklin Institute\u00a0279, 290\u2013308 (1965)","journal-title":"J. Franklin Institute"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Erd\u0151s, P.L., Mikl\u00f3s, I., Toroczkai, Z.: A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs. The Electronic Journal of Combinatorics 17, #R66 (2010)","DOI":"10.37236\/338"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/(SICI)1098-2418(199907)14:4<293::AID-RSA1>3.0.CO;2-G","volume":"14","author":"R. Kannan","year":"1999","unstructured":"Kannan, R., Tetali, P., Vempala, S.: Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Structures and Algorithms\u00a014, 293\u2013308 (1999)","journal-title":"Random Structures and Algorithms"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1017\/S0963548306007978","volume":"16","author":"C. Cooper","year":"2007","unstructured":"Cooper, C., Dyer, M., Greenhill, C.: Sampling regular graphs and a peer-to-peer network. Combinatorics, Probability and Computing\u00a016, 557\u2013593 (2007)","journal-title":"Combinatorics, Probability and Computing"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M. Jerrum","year":"2004","unstructured":"Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. Journal of the ACM\u00a051, 671\u2013697 (2004)","journal-title":"Journal of the ACM"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1002\/rsa.20155","volume":"30","author":"I. Bez\u00e1kov\u00e1","year":"2007","unstructured":"Bez\u00e1kov\u00e1, I., Bhatnagar, N., Vigoda, E.: Sampling binary contingency tables with a greedy start. Random Structures and Algorithms\u00a030, 168\u2013205 (2007)","journal-title":"Random Structures and Algorithms"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/0196-6774(90)90029-E","volume":"11","author":"B. McKay","year":"1990","unstructured":"McKay, B., Wormald, N.: Uniform generation of random regular graphs of moderate degree. J. Algorithms\u00a011, 52\u201367 (1990)","journal-title":"J. Algorithms"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF01275671","volume":"11","author":"B. McKay","year":"1991","unstructured":"McKay, B., Wormald, N.: Asymptotic enumeration by degree sequence of graphs with degrees o(n1\/2 ). Combinatorica\u00a011, 369\u2013382 (1991)","journal-title":"Combinatorica"},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1017\/S0963548399003867","volume":"8","author":"A. Steger","year":"1999","unstructured":"Steger, A., Wormald, N.: Generating random regular graphs quickly. Combinatorics, Probability, and Computing\u00a08, 377\u2013396 (1999)","journal-title":"Combinatorics, Probability, and Computing"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Kim, J., Vu, V.: Generating random regular graphs. In: STOC, pp. 213\u2013222 (2003)","DOI":"10.1145\/780542.780576"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Bayati, M., Kim, J.H., Saberi, A.: A sequential algorithm for generating random graphs. Algorithmica (2009) doi 10.1007\/s00453-009-9340-1","DOI":"10.1007\/s00453-009-9340-1"},{"key":"21_CR23","first-page":"482","volume-title":"Approximation Algorithms for NP-hard Problems","author":"M. Jerrum","year":"1996","unstructured":"Jerrum, M., Sinclair, A.: The Markov chain Monte Carlo method: An approach to approximate counting and integration. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard Problems, pp. 482\u2013520. PWS Publishing, Boston (1996)"},{"key":"21_CR24","first-page":"225","volume":"58","author":"A. Rao","year":"1996","unstructured":"Rao, A., Jana, R., Bandyopadhyay, S.: A Markov chain Monte Carlo method for generating random (0,1)\u2013matrices with given marginals. Sankhya: The Indian Journal of Statistics\u00a058, 225\u2013242 (1996)","journal-title":"Sankhya: The Indian Journal of Statistics"},{"key":"21_CR25","unstructured":"LaMar, M.D.: Algorithms for realizing degree sequences for directed graphs, arXiv.org:0906.0343v1 (2009)"},{"key":"21_CR26","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R. Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science\u00a0298, 824\u2013827 (2002)","journal-title":"Science"},{"key":"21_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-31955-9_3","volume-title":"Network Analysis","author":"D. Kosch\u00fctzki","year":"2005","unstructured":"Kosch\u00fctzki, D., Lehmann, K.A., Peeters, L., Richter, S., Tenfelde-Podehl, D., Zlotowski, O.: Centrality indices. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol.\u00a03418, pp. 16\u201361. Springer, Heidelberg (2005)"},{"key":"21_CR28","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Graph Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16926-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T04:27:11Z","timestamp":1636777631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16926-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169250","9783642169267"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16926-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}