Unranking and ranking spanning trees of a graph

Authors:
C. J. Colbourn;R. P. Day;L. D. Nel
Affiliations:
Univ. of Waterloo, Ontario, Canada;Univ. of Waterloo, Ontario, Canada;Univ. of Waterloo, Ontario, Canada
Venue:
Journal of Algorithms
Year:
1989

Citing 0
Cited 4

Generating random spanning trees more quickly than the cover time

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges

Proceedings of the 2002 ACM symposium on Applied computing
On the number of broadcast schemes in networks

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract