Finding the K Smallest Spanning Trees

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-52846-6_76
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg