{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T21:33:01Z","timestamp":1776115981195,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0196-6774(90)90002-v","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"185-207","source":"Crossref","is-referenced-by-count":28,"title":["Generating random combinatorial objects"],"prefix":"10.1016","volume":"11","author":[{"given":"V.G","family":"Kulkarni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(90)90002-V_BIB1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/net.3230100206","article-title":"The complexity network reliability computations","volume":"10","author":"Ball","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0196-6774(90)90002-V_BIB2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/net.3230130210","article-title":"Calculating bounds on reachability and connectedness in stochastic networks","volume":"13","author":"Ball","year":"1983","journal-title":"Networks"},{"key":"10.1016\/0196-6774(90)90002-V_BIB3","article-title":"Unranking and Ranking Spanning Trees of a Graph","author":"Colbourn","year":"1988"},{"key":"10.1016\/0196-6774(90)90002-V_BIB4","series-title":"Nonuniform Random Variate Generation","author":"Devroye","year":"1986"},{"key":"10.1016\/0196-6774(90)90002-V_BIB5","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1137\/0207025","article-title":"Efficient calculation of expected miss ratios in the independent reference model","volume":"7","author":"Fagin","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(90)90002-V_BIB6","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1287\/opre.34.4.581","article-title":"A Monte Carlo sampling plan for estimating network reliability","volume":"34","author":"Fishman","year":"1986","journal-title":"Oper. Res."},{"key":"10.1016\/0196-6774(90)90002-V_BIB7","series-title":"Graph Theory","author":"Harary","year":"1972"},{"key":"10.1016\/0196-6774(90)90002-V_BIB8","author":"Knuth","year":"1980"},{"key":"10.1016\/0196-6774(90)90002-V_BIB9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0167-6377(84)90005-1","article-title":"A compact hash function for paths in PERT networks","volume":"3","author":"Kulkarni","year":"1984","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0196-6774(90)90002-V_BIB10","article-title":"Generating Random Spanning Trees","author":"Kulkarni","year":"1985"},{"key":"10.1016\/0196-6774(90)90002-V_BIB11","article-title":"Combining Monte Carlo Estimates and Bounds for Network Reliability","author":"Nel","year":"1988"},{"key":"10.1016\/0196-6774(90)90002-V_BIB12","doi-asserted-by":"crossref","DOI":"10.21236\/ADA144940","article-title":"Simulation Uses of the Exponential Distribution","author":"Ross","year":"1984"},{"key":"10.1016\/0196-6774(90)90002-V_BIB13","unstructured":"G. Tinhofer, On the generation of random graphs with given properties and known distribution, in \u201cGraphs, Data Structures, Algorithms\u201d (M. Nagl, Ed.), pp. 265\u2013297."},{"key":"10.1016\/0196-6774(90)90002-V_BIB14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0209009","article-title":"An efficient method for weighted sampling without replacement","volume":"9","author":"Wong","year":"1980","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749090002V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749090002V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:54:09Z","timestamp":1548744849000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749090002V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["019667749090002V"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(90)90002-v","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}