Finding thek smallest spanning trees
- 1 June 1992
- journal article
- algorithm theory
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 32 (2), 237-248
- https://doi.org/10.1007/bf01994879
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Efficient algorithms for graphic matroid intersection and parityPublished by Springer Nature ,2005
- Offline algorithms for dynamic minimum spanning tree problemsPublished by Springer Nature ,2005
- Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Finding k points with minimum diameter and related problemsJournal of Algorithms, 1991
- A linear-time algorithm for computing the voronoi diagram of a convex polygonDiscrete & Computational Geometry, 1989
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- Two Algorithms for Generating Weighted Spanning Trees in OrderSIAM Journal on Computing, 1977
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- Time bounds for selectionJournal of Computer and System Sciences, 1973