Subgraph induced planar connectivity augmentation (extended abstract)

DOI10.1007/B93953MaRDI QIDQ5902527zbMATH OpenFDO

Authors Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher

Publication date 12 January 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/B93953

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A polyhedral approach to planar augmentation and related problems
• scientific article; zbMATH DE number 177556
• Augmenting the connectivity of planar and geometric graphs
• scientific article; zbMATH DE number 1303565
• Compatible connectivity augmentation of planar disconnected graphs

Cited in

(6)

• Clustered Planarity: Clusters with Few Outgoing Edges
• Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
• Correlation clustering and two-edge-connected augmentation for planar graphs
• A polyhedral approach to planar augmentation and related problems
• Planar bus graphs
• Approximation schemes for planar graph connectivity problems

This page was built for publication: Subgraph induced planar connectivity augmentation (extended abstract)

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