论文信息 - Generating Random Combinatorial Objects - 字舞流文

Generating Random Combinatorial Objects

Vidyadhar G. Kulkarni | V. Kulkarni

[1] Frank Harary,et al. Graph Theory , 2016 .

[2] Ronald Fagin,et al. Efficient Calculation of Expected Miss Ratios in the Independent Reference Model , 1978, SIAM J. Comput..

[3] Manfred Nagl,et al. Graphs, data structures, algorithms , 1979 .

[4] Chak-Kuen Wong,et al. An Efficient Method for Weighted Sampling Without Replacement , 1980, SIAM J. Comput..

[5] Michael O. Ball,et al. Complexity of network reliability computations , 1980, Networks.

[6] J. Scott Provan,et al. Calculating bounds on reachability and connectedness in stochastic networks , 1983, Networks.

[7] V. Kulkarni. Review of recent development: A compact hash function for paths in PERT networks , 1984 .

[8] L. Devroye. Non-Uniform Random Variate Generation , 1986 .

[9] George S. Fishman,et al. A Monte Carlo Sampling Plan for Estimating Network Reliability , 1984, Oper. Res..

[10] Sheldon M. Ross,et al. Simulation uses of the exponential distribution , 1986 .

[11] Charles J. Colbourn,et al. Unranking and Ranking Spanning Trees of a Graph , 1989, J. Algorithms.

[12] Andrei Z. Broder,et al. Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.

[13] Charles J. Colbourn,et al. Combining monte carlo estimates and bounds for network reliability , 1990, Networks.