Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs
From MaRDI portal
Publication:2980910
DOI10.1007/978-3-319-53925-6_16zbMath1430.68171arXiv1612.04780OpenAlexW2583988881MaRDI QIDQ2980910
Hugo A. Akitaya, Diane L. Souvaine, Charles R. Winston, Torrie L. Nichols, Rajasekhar Inkulu, Csaba D. Tóth
Publication date: 5 May 2017
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.04780
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- Unnamed Item
- Connectivity augmentation in planar straight line graphs
- Augmenting the connectivity of geometric graphs
- Computing minimum length paths of a given homotopy class
- A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\)
- Computing homotopic shortest paths efficiently
- Plane Geometric Graph Augmentation: A Generic Perspective
- Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points
- A new algorithm for computing visibility graphs of polygonal obstacles in the plane
- Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs
- Augmenting Undirected Node-Connectivity by One
- Augmenting the Connectivity of Planar and Geometric Graphs
- BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS
- Planar Biconnectivity Augmentation with Fixed Embedding
- Approximation Algorithms for Several Graph Augmentation Problems
- Computing homotopic shortest paths in the plane
- OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
