{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:35:13Z","timestamp":1729614913292,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1109\/wsc.2011.6148031","type":"proceedings-article","created":{"date-parts":[[2012,2,9]],"date-time":"2012-02-09T22:20:26Z","timestamp":1328826026000},"page":"3348-3359","source":"Crossref","is-referenced-by-count":4,"title":["Directed 3-cycle anchored digraphs and their application in the uniform sampling of realizations from a fixed degree sequence"],"prefix":"10.1109","author":[{"given":"M. Drew","family":"LaMar","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Algorithms for realizing degree sequences of directed graphs","author":"lamar","year":"2010","journal-title":"arXiv 0906 0343"},{"key":"ref11","article-title":"Split digraphs","author":"lamar","year":"2010","journal-title":"arXiv 1005 2452"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/35082140"},{"key":"ref13","first-page":"1","article-title":"Random walks on graphs: A survey","volume":"2","author":"lovasz","year":"1993","journal-title":"Combinatorics"},{"journal-title":"Threshold Graphs and Related Topics Volume 56 (Annals of Discrete Mathematics)","year":"1995","author":"mahadev","key":"ref14"},{"key":"ref15","first-page":"225","article-title":"A Markov chain Monte Carlo method for generating random (0, l)-matrices with given marginals","volume":"58","author":"rao","year":"1996","journal-title":"Sankhya Ser A"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0092288"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(00)00026-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.2307\/3647877"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2010.557277"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/338","article-title":"A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs","volume":"17","author":"erd\u00f3s","year":"2010","journal-title":"The Electronic Journal of Combinatorics"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0010012"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"831","DOI":"10.2140\/pjm.1960.10.831","article-title":"Zero-one matrices with zero trace","volume":"10","author":"fulkerson","year":"2004","journal-title":"Pacific Journal of Mathematics"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100384055"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16926-7_21"},{"article-title":"Graphs and hypergraphs","year":"1973","author":"berge","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/42\/39\/392001"}],"event":{"name":"2011 Winter Simulation Conference - (WSC 2011)","start":{"date-parts":[[2011,12,11]]},"location":"Phoenix, AZ, USA","end":{"date-parts":[[2011,12,14]]}},"container-title":["Proceedings of the 2011 Winter Simulation Conference (WSC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6135535\/6147014\/06148031.pdf?arnumber=6148031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T01:52:06Z","timestamp":1593654726000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6148031\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/wsc.2011.6148031","relation":{},"subject":[],"published":{"date-parts":[[2011,12]]}}}