Finding the \(k\) smallest spanning trees
From MaRDI portal
Publication:1196455
DOI10.1007/BF01994879zbMath0761.68045WikidataQ56077949 ScholiaQ56077949MaRDI QIDQ1196455
Publication date: 14 December 1992
Published in: BIT (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- On the spanning trees of weighted graphs
- Preserving order in a forest in less than logarithmic time and linear space
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
- Sorting helps for Voronoi diagrams
- Time bounds for selection
- Applications of Path Compression on Balanced Trees
- Finding k points with minimum diameter and related problems
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Thek best spanning arborescences of a network
- An Algorithm for Finding K Minimum Spanning Trees
- Two Algorithms for Generating Weighted Spanning Trees in Order
- Finding Minimum Spanning Trees
