Counting Minimum Weight Spanning Trees

Journal of Algorithms

Volumn 24, Issue 1, 1997, Pages 171-176

  Broder, Andrei Z ^a   Mayr, Ernst W ^b  

^a HEWLETT PACKARD COMPANY   (United States)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (3)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA, 1974.
2. S. Even, "Graph Algorithms," Comput. Sci. Press, New York, 1979.
3. F. Gavril, Generating the maximum spanning-trees of a weighted graph, J. Algorithms 8 (1987), 592-297.