BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS

DOI10.1142/S179383091250036XzbMath1253.68033OpenAlexW2008562682MaRDI QIDQ3166746

Oscar Morales-Ponce, Ladislav Stacho, Evangelos Kranakis, Danny Krizanc

Publication date: 15 October 2012

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179383091250036x

zbMATH Keywords

augmentationfault tolerancedeletion2-edge connectedlocalminimum number of edgesUDGgeometric planar spanning graph

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)

Related Items

Plane augmentation of plane graphs to meet parity constraints ⋮ Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs ⋮ Minimum weight connectivity augmentation for planar straight-line graphs

Cites Work

• Augmenting the connectivity of geometric graphs
• Edge-connectivity augmentation problems
• Independence free graphs and vertex connectivity augmentation
• Augmentation Problems
• Distributed Computing: A Locality-Sensitive Approach
• Augmenting Outerplanar Graphs
• Augmenting the Connectivity of Planar and Geometric Graphs