Two Algorithms for Unranking Arborescences

Journal of Algorithms

Volumn 20, Issue 2, 1996, Pages 268-281

  Colbourn, Charles J ^a   Myrvold, Wendy J ^b   Neufeld, Eugene ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARITHMETIC OPERATION; DIRECTED GRAPH; MATRIX PRODUCT; SPANNING TREE; TREE(GRAPH);

ALGORITHMS;

EID: 0030372787     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0014     Document Type: Article

References (26)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA, 1974.
2. D. Aldous, The random walk construction for spanning trees and uniform labelled trees, SIAM J. Discrete Math. 3 (1990), 450-465.
3. M. S. Bartlett, An inverse matrix adjustment arising in discriminant analysis, Ann. Math. Statist. 22 (1951), 107-111.
4. J. A. Bondy and U. S. R. Murty, "Graph Theory with Applications," Elsevier, New York, 1976.
5. A. Z. Broder, Generating random spanning trees, FOCS (1989), 442-447.
6. C. J. Colbourn, "The Combinatorics of Network Reliability," The International Series of Monographs on Computer Science, Oxford Univ. Press, New York, 1987.
7. C. J. Colbourn, B. M. Debroni, and W. J. Myrvold, Estimating the coefficients of the reliability polynomial, in "Proceedings of the Seventeenth Manitoba Conference on Numerical Mathematics and Computing," Congr. Numer. 62 (1988) 217-223.
8. C. J. Colbourn, R. P. J. Day, and L. D. Nel, Unranking and ranking spanning trees of a graph, J. Algorithms 10 (1989), 271-286.
9. D. Coppersmith and S. Winograd, Matrix multiplications via arithmetic progressions, STOC (1987), 1-6.
10. W. D. Dixon and H. S. Wilf, The random selection of unlabeled graphs, J. Algorithms 4 (1984), 205-213.
11. A. Gibbons, "Algorithmic Graph Theory," Cambridge Univ. Press, New York, 1985.
12. A. Guénoche, Random spanning tree, J. Algorithms 4 (1983), 214-220.
13. W. H. Hager, "Applied Numerical Linear Algebra," Prentice-Hall, Englewood Cliffs, NJ, 1988.
14. W. H. Hager, Updating the inverse of a matrix, SIAM Rev. 31, No. 2 (1989), 221-239.
15. G. Katona, A theorem of finite sets, in "Theory of Graphs" (P. Erdös, and G. Katona, Eds.), pp. 187-207, Akademia Kiado, Budapest, 1966.
16. G. Kirchoff, Uber die Auflösung der Gleichungen auf welche man sei der Untersuchung der Linearen Verteilung Galvanischer Strome Gefuhrt wind, Poggendorg's Ann. Phys. Chem. 72 (1847), 497-508. Also appears as On the solution of equations obtained from the investigation of the linear distribution of galvanic currents, IRE Trans. Circuit Theory 5 (1958), 4-7.
17. G. Kirchoff, Uber die Auflösung der Gleichungen auf welche man sei der Untersuchung der Linearen Verteilung Galvanischer Strome Gefuhrt wind, Poggendorg's Ann. Phys. Chem. 72 (1847), 497-508. Also appears as On the solution of equations obtained from the investigation of the linear distribution of galvanic currents, IRE Trans. Circuit Theory 5 (1958), 4-7.
18. G. D. Knott, A numbering system for binary trees, Comm. ACM 20 (1977), 113-115.
19. J. B. Kruskal, The number of simplices in a complex, in "Mathematical Optimization Techniques" (R. Bellman, Ed.), pp. 251-278, Univ. of California Press, 1963.
20. V. G. Kulkarni, Generating random combinatorial objects, J. Algorithms 11 (1990), 185-207.
21. L. D. Nel and C. J. Colbourn, Combining Monte Carlo estimates and bounds for network reliability, Networks 20 (1990), 227-298.
22. H. Prufer, Neuer Beweis eines Satzes uber Permutationen, Arch. Math. Phys. 27 (1918), 742-744.
23. J. Sherman and W. J. Morrison, Adjustment of an inverse matrix corresponding to changes in the elements of a given column or a given row of the original matrix, Ann.Math. Statist. 20 (1949), 621.
24. G. Strang, "Linear Algebra and Its Applications," Academic Press, New York, 1976.
25. V. Strassen, Gaussian elimination is not optimal, Numer. Math. 13 (1974), 354-356.
26. N. C. Wormald, Generating random regular graphs, J. Algorithms 5 (1984), 247-280.