Finding the k smallest spanning trees (1990)

by D Eppstein
Venue:In Proc. 2nd Scandinavian Worksh. Algorithm Theory, number 447 in Lecture Notes in Computer Science