Approximation of pathwidth of outerplanar graphs
From MaRDI portal
Recommendations
Cited in
(29)- Approximate search strategies for weighted trees
- Non-deterministic graph searching in trees
- A polynomial-time algorithm for outerplanar diameter improvement
- Outerplanar obstructions for matroid pathwidth
- Approximating the pathwidth of outerplanar graphs
- A polynomial-time algorithm for outerplanar diameter improvement
- Connected Graph Searching in Outerplanar Graphs
- Pathwidth of outerplanar graphs
- On self duality of pathwidth in polyhedral graph embeddings
- Pathwidth of Circular-Arc Graphs
- Outerplanar obstructions for matroid pathwidth
- On self-duality of branchwidth in graphs of bounded genus
- scientific article; zbMATH DE number 2044933 (Why is no real title available?)
- A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs
- 2-connecting outerplanar graphs without blowing up the pathwidth
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition
- Circumference and pathwidth of highly connected graphs
- A 3-approximation for the pathwidth of Halin graphs
- A 3-approximation for the pathwidth of Halin graphs
- Computing the vertex separation of unicyclic graphs
- Approximating Pathwidth for Graphs of Small Treewidth
- Splitting plane graphs to outerplanarity
- Pathlength of outerplanar graphs
- Branchwidth is \((1, g)\)-self-dual
- Pathwidth vs Cocircumference
- Splitting plane graphs to outerplanarity
- Pathlength of outerplanar graphs
- 2-connecting outerplanar graphs without blowing up the pathwidth
- Linear-time algorithms for problems on planar graphs with fixed disk dimension
This page was built for publication: Approximation of pathwidth of outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3150282)
