A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs
From MaRDI portal
Publication:3569129
Recommendations
- A randomized linear-time algorithm for finding minimum spanning trees (extended abstract)
- Upper and lower bounding procedures for the minimum caterpillar spanning problem
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- A randomized linear-time algorithm to find minimum spanning trees
- A linear-time algorithm for finding a minimum spanning pseudoforest
- Near-linear time algorithm for approximate minimum degree spanning trees
- An algorithm for geometric minimum spanning trees requiring nearly linear expected time
- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
- A branch and bound algorithm for the capacitated minimum spanning tree problem
Cited in
(6)- Euclidean networks with a backbone and a limit theorem for minimum spanning caterpillars
- On the minimum caterpillar problem in digraphs
- Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope
- The caterpillar-packing polytope
- Upper and lower bounding procedures for the minimum caterpillar spanning problem
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
This page was built for publication: A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569129)