Augmenting the Connectivity of Planar and Geometric Graphs

DOI10.1016/j.endm.2008.06.009zbMath1267.05157OpenAlexW2098823334MaRDI QIDQ5300981

Alexander Wolff, Ignaz Rutter

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

planaritygeometric graphsNP-hardnessconnectivity augmentation

Mathematics Subject Classification ID

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

Related Items (6)

BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS ⋮ IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION ⋮ Compatible spanning trees ⋮ Augmenting the edge connectivity of planar straight line graphs to three ⋮ Connectivity augmentation in planar straight line graphs ⋮ Augmenting the Connectivity of Planar and Geometric Graphs

Cites Work

• Unnamed Item
• Augmenting the connectivity of geometric graphs
• Computing Simple Circuits from a Set of Line Segments is NP-Complete
• Augmentation Problems
• Augmenting Outerplanar Graphs
• Augmenting the Connectivity of Planar and Geometric Graphs

This page was built for publication: Augmenting the Connectivity of Planar and Geometric Graphs