2-connecting outerplanar graphs without blowing up the pathwidth
DOI10.1016/J.TCS.2014.04.032zbMATH Open1383.68058OpenAlexW2095283118MaRDI QIDQ744095FDOQ744095
Authors: Jasine Babu, L. Sunil Chandran, Deepak Rajendraprasad, Manu Basavaraju 
Publication date: 6 October 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.04.032
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Cites Work
- Characterizations of outerplanar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Approximating the pathwidth of outerplanar graphs
- Graph minors. III. Planar tree-width
- Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
- PATHWIDTH AND LAYERED DRAWINGS OF TREES
- Augmenting Outerplanar Graphs
- Augmenting the connectivity of outerplanar graphs
- Title not available (Why is that?)
Cited In (5)
- Triangulating Planar Graphs While Keeping the Pathwidth Small
- B0-VPG Representation of AT-free Outerplanar Graphs
- Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs
- A polynomial-time algorithm for outerplanar diameter improvement
- A Polynomial-Time Algorithm for Outerplanar Diameter Improvement
Uses Software
This page was built for publication: 2-connecting outerplanar graphs without blowing up the pathwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744095)
