Augmenting the connectivity of planar and geometric graphs

DOI10.1016/J.ENDM.2008.06.009MaRDI QIDQ5300981zbMATH OpenOpenAlexFDO

Authors Ignaz Rutter, Alexander Wolff

Publication date 28 June 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://publikationen.bibliothek.kit.edu/1000007814/978935

zbMATH Keywords

connectivity augmentationgeometric graphsNP-hardnessplanarity

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Recommendations

• Augmenting the connectivity of planar and geometric graphs
• Augmenting the connectivity of geometric graphs
• Connectivity augmentation in planar straight line graphs
• Minimum weight connectivity augmentation for planar straight-line graphs
• scientific article; zbMATH DE number 177556

Cites work

• Augmentation Problems
• Augmenting Outerplanar Graphs
• Augmenting the connectivity of geometric graphs
• Augmenting the connectivity of planar and geometric graphs
• Computing Simple Circuits from a Set of Line Segments is NP-Complete
• scientific article; zbMATH DE number 177556 (Why is no real title available?)

Cited in

(25)

• Reaching 3-connectivity via edge-edge additions
• Geometric biplane graphs. II: Graph augmentation
• Compatible spanning trees
• Plane geometric graph augmentation: a generic perspective
• Augmenting outerplanar graphs to meet diameter requirements
• Approximating the edge length of 2-edge connected planar geometric graphs on a set of points
• Bounded length, 2-edge augmentation of geometric planar graphs
• Augmenting the connectivity of planar and geometric graphs
• Bounded length, 2-edge augmentation of geometric planar graphs
• scientific article; zbMATH DE number 177556 (Why is no real title available?)
• Two-Connected Augmentation Problems in Planar Graphs
• Cubic augmentation of planar graphs
• IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION
• Augmenting the connectivity of planar and geometric graphs
• Algorithm Theory - SWAT 2004
• Compatible connectivity-augmentation of planar disconnected graphs
• Correlation clustering and two-edge-connected augmentation for planar graphs
• Augmenting the edge connectivity of planar straight line graphs to three
• Connectivity augmentation in planar straight line graphs
• Efficient recognition of subgraphs of planar cubic bridgeless graphs
• Approximation schemes for planar graph connectivity problems
• Regular augmentation of planar graphs
• Augmenting the connectivity of outerplanar graphs
• Compatible connectivity augmentation of planar disconnected graphs
• Augmenting the connectivity of geometric graphs

This page was built for publication: Augmenting the connectivity of planar and geometric graphs

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