Pages that link to "Item:Q3569129"
From MaRDI portal
The following pages link to A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs (Q3569129):
Displaying 5 items.
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
- Upper and lower bounding procedures for the minimum caterpillar spanning problem (Q2840519) (← links)
- Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars (Q3465943) (← links)
- Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope (Q5244302) (← links)
- The caterpillar-packing polytope (Q5916056) (← links)