Using sparsification for parametric minimum spanning tree problems

David Fernández-Baca, Giora Slutzki, and David Eppstein
Nordic J. Computing 3(4):352–366, 1996
Proc. 5th Scandinavian Worksh. Algorithm Theory (SWAT 1996), Lecture Notes in Computer Science 1097, Rolf G. Karlsson and Andrzej Lingas, ed., Springer-Verlag, Jul 1996, pp. 149–160
http://www.ics.uci.edu/~eppstein/pubs/FerSluEpp-SWAT-96.ps.gz
http://www.ics.uci.edu/~eppstein/pubs/FerSluEpp-NJC-96.pdf

Cited by:

• Multi-parameter minimum spanning trees
• Notes on computing peaks in $k$-levels and parametric spanning trees
• Decomposable multi-parameter matroid optimization problems
• Finding the shortest bottleneck edge in a parametric minimum spanning tree