Generating random combinatorial objects

Ball, 1980, The complexity network reliability computations, Networks, 10, 153, 10.1002/net.3230100206 Ball, 1983, Calculating bounds on reachability and connectedness in stochastic networks, Networks, 13, 253, 10.1002/net.3230130210 Colbourn, 1988, Unranking and Ranking Spanning Trees of a Graph Devroye, 1986 Fagin, 1978, Efficient calculation of expected miss ratios in the independent reference model, SIAM J. Comput., 7, 288, 10.1137/0207025 Fishman, 1986, A Monte Carlo sampling plan for estimating network reliability, Oper. Res., 34, 581, 10.1287/opre.34.4.581 Harary, 1972 Knuth, 1980 Kulkarni, 1984, A compact hash function for paths in PERT networks, Oper. Res. Lett., 3, 137, 10.1016/0167-6377(84)90005-1 Kulkarni, 1985, Generating Random Spanning Trees Nel, 1988, Combining Monte Carlo Estimates and Bounds for Network Reliability Ross, 1984, Simulation Uses of the Exponential Distribution, 10.21236/ADA144940 G. Tinhofer, On the generation of random graphs with given properties and known distribution, in “Graphs, Data Structures, Algorithms” (M. Nagl, Ed.), pp. 265–297. Wong, 1980, An efficient method for weighted sampling without replacement, SIAM J. Comput., 9, 111, 10.1137/0209009