2-connecting outerplanar graphs without blowing up the pathwidth

DOI10.1016/J.TCS.2014.04.032MaRDI QIDQ744095zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

pathwidthouterplanar graph2-vertex-connected

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• 2-connecting outerplanar graphs without blowing up the pathwidth
• Augmenting the connectivity of outerplanar graphs
• scientific article; zbMATH DE number 2044933
• Approximation of pathwidth of outerplanar graphs
• Augmenting Outerplanar Graphs

Cites work

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 1974106 (Why is no real title available?)
• scientific article; zbMATH DE number 3259770 (Why is no real title available?)
• Approximating the pathwidth of outerplanar graphs
• Augmenting Outerplanar Graphs
• Augmenting the connectivity of outerplanar graphs
• Characterizations of outerplanar graphs
• Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
• Graph minors. III. Planar tree-width
• PATHWIDTH AND LAYERED DRAWINGS OF TREES
• Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs

Cited in

(6)

• Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs
• 2-connecting outerplanar graphs without blowing up the pathwidth
• A polynomial-time algorithm for outerplanar diameter improvement
• B0-VPG Representation of AT-free Outerplanar Graphs
• Triangulating planar graphs while keeping the pathwidth small
• A polynomial-time algorithm for outerplanar diameter improvement

Describes a project that uses

Uses Software

• Algorithm 447

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)