Two-Connected Augmentation Problems in Planar Graphs

DOI10.1006/JAGM.1999.1005MaRDI QIDQ4264489zbMATH OpenOpenAlexFDO

Authors J. Scott Provan, Roger C. Burk

Publication date 22 September 1999

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/d9fb6f3d53bdee1ccd1869420a6917c1cd534b50

zbMATH Keywords

weighted undirected graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 177556
• Augmenting the connectivity of planar and geometric graphs
• Augmenting the connectivity of planar and geometric graphs
• scientific article; zbMATH DE number 1187145
• The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
• Connectivity augmentation in planar straight line graphs
• Bounded length, 2-edge augmentation of geometric planar graphs
• Bounded length, 2-edge augmentation of geometric planar graphs
• Regular augmentation of planar graphs

Cited in

(9)

• Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)
• The Two-Edge Connectivity Survivable Network Problem in Planar Graphs
• On finding two-connected subgraphs in planar graphs
• Correlation clustering and two-edge-connected augmentation for planar graphs
• On distance-\(d\) Independent Set and other problems in graphs with ``few minimal separators
• The two-edge connectivity survivable-network design problem in planar graphs
• Graph-Theoretic Concepts in Computer Science
• A simple algorithm for multicuts in planar graphs with outer terminals
• Correlation clustering and two-edge-connected augmentation for planar graphs

This page was built for publication: Two-Connected Augmentation Problems in Planar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4264489)