The minimum spanning tree problem on a planar graph
From MaRDI portal
Recommendations
- An optimal parallel algorithm for minimum spanning trees in planar graphs
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- Two linear time algorithms for MST on minor closed graph classes.
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- An optimal minimum spanning tree algorithm
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- A note on two problems in connexion with graphs
- Efficient Planarity Testing
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Fibonacci heaps and their uses in improved network optimization algorithms
- Finding Minimum Spanning Trees
- On the shortest spanning subtree of a graph and the traveling salesman problem
Cited in
(11)- Efficient minimum spanning tree construction with Delaynay triangulation
- Contracting a planar graph efficiently
- Two linear time algorithms for MST on minor closed graph classes.
- Planar bichromatic minimum spanning trees
- Minimum spanning tree cycle intersection problem
- Faster shortest paths in dense distance graphs, with applications
- scientific article; zbMATH DE number 1910742 (Why is no real title available?)
- An O(N log N) minimal spanning tree algorithm for N points in the plane
- A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs”
- An algorithm for \(k^{\text{th}}\) minimum spanning tree
- The saga of minimum spanning trees
This page was built for publication: The minimum spanning tree problem on a planar graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805468)
