Enumerating the k best plane spanning trees
Authors:
- 1 February 2001
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 18 (1) , 55-64
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Reverse search for enumerationDiscrete Applied Mathematics, 1996
- An Algorithm for Finding K Minimum Spanning TreesSIAM Journal on Computing, 1981
- The k best spanning arborescences of a networkNetworks, 1980
- Two Algorithms for Generating Weighted Spanning Trees in OrderSIAM Journal on Computing, 1977