Finding the k smallest spanning trees
From MaRDI portal
Publication:5056090
DOI10.1007/3-540-52846-6_76zbMath1502.68222OpenAlexW1554127434MaRDI QIDQ5056090
Publication date: 9 December 2022
Published in: SWAT 90 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-52846-6_76
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
