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:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!