Planar biconnectivity augmentation with fixed embedding

DOI10.1007/978-3-642-10217-2_29MaRDI QIDQ3651554zbMATH OpenOpenAlexWikidataFDO

Authors Carsten Gutwenger, Petra Mutzel, Bernd Zey

Publication date 11 December 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-10217-2_29

zbMATH Keywords

planar biconnectivity augmentation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On the Hardness and Approximability of Planar Biconnectivity Augmentation
• scientific article; zbMATH DE number 177556
• Connectivity augmentation in planar straight line graphs
• A polyhedral approach to planar augmentation and related problems
• Regular augmentation of planar graphs

Cited in

(7)

• Minimum weight connectivity augmentation for planar straight-line graphs
• Minimum weight connectivity augmentation for planar straight-line graphs
• Simpler and faster biconnectivity augmentation
• Cubic augmentation of planar graphs
• On the Hardness and Approximability of Planar Biconnectivity Augmentation
• Network augmentation for disaster‐resilience against geographically correlated failure
• Connectivity augmentation in planar straight line graphs

Describes a project that uses

Uses Software

• PARTITION

This page was built for publication: Planar biconnectivity augmentation with fixed embedding

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