Finding the $k$ smallest spanning trees

David Eppstein
BIT 32(2):237–248, 1992
Proc. 2nd Scandinavian Worksh. Algorithm Theory (SWAT 1990), Lecture Notes in Computer Science 447, John Russell Gilbert and Rolf G. Karlsson, ed., Springer-Verlag, Jul 1990, pp. 38–47
Mathematical Reviews 94e:05082
http://www.ics.uci.edu/~eppstein/pubs/Epp-BIT-92.pdf

Cited by:

• Ambivalent data structures for dynamic 2-edge-connectivity and $k$ smallest spanning trees
• A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
• Voronoi diagrams — a survey of a fundamental geometric data structure
• Generation of color-constrained spanning trees with application in symbolic circuit analysis
• The minimum labeling spanning trees
• Finding precursor compounds in secondary metabolism
• Graph modeling of metabolism