Pages that link to "Item:Q293398"
From MaRDI portal
The following pages link to Approximating the pathwidth of outerplanar graphs (Q293398):
Displaying 8 items.
- Computing the vertex separation of unicyclic graphs (Q596295) (← links)
- 2-connecting outerplanar graphs without blowing up the pathwidth (Q744095) (← links)
- Linear-time algorithms for problems on planar graphs with fixed disk dimension (Q845887) (← links)
- Order-Preserving 1-String Representations of Planar Graphs (Q2971141) (← links)
- Approximation of pathwidth of outerplanar graphs (Q3150282) (← links)
- A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs (Q4485193) (← links)
- A 3-approximation for the pathwidth of Halin graphs (Q5898649) (← links)
- Shortest beer path queries in outerplanar graphs (Q6103523) (← links)