Augmenting the edge connectivity of planar straight line graphs to three
From MaRDI portal
Publication:652523
DOI10.1007/s00453-011-9551-0zbMath1235.05077OpenAlexW1981160608MaRDI QIDQ652523
Csaba D. Tóth, Kristóf Rédei, Mashhood Ishaque, Diane L. Souvaine, Pavel Valtr, Marwan Al-Jubeh
Publication date: 14 December 2011
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-011-9551-0
Related Items (6)
Plane augmentation of plane graphs to meet parity constraints ⋮ Compatible spanning trees ⋮ Connectivity augmentation in planar straight line graphs ⋮ Minimum weight connectivity augmentation for planar straight-line graphs ⋮ Geometric biplane graphs. I: Maximal graphs ⋮ Geometric biplane graphs. II: Graph augmentation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connectivity augmentation in planar straight line graphs
- Maintenance of 2- and 3-edge-connected components of graphs. I
- Graph connectivity and its augmentation: Applications of MA orderings
- On triconnected and cubic plane graphs on given point sets
- Augmenting the connectivity of outerplanar graphs
- Augmenting the connectivity of geometric graphs
- A vertex-face assignment for plane graphs
- Edge-connectivity augmentation problems
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- A linear algorithm for finding the convex hull of a simple polygon
- Applications of a semi-dynamic convex hull algorithm
- Minimum block containing a given graph
- Successive edge-connectivity augmentation problems
- An edge-splitting algorithm in planar graphs
- Independence free graphs and vertex connectivity augmentation
- An efficient algorithm for determining the convex hull of a finite planar set
- Augmenting undirected node-connectivity by one
- Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
- Finding a Smallest Augmentation to Biconnect a Graph
- On the convex layers of a planar set
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Maintaining the 3-Edge-Connected Components of a Graph On-Line
- Augmentation Problems
- Smallest Augmentations to Biconnect a Graph
- A Reduction Method for Edge-Connectivity in Graphs
- Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time
- Simpler and faster biconnectivity augmentation
- Augmenting Outerplanar Graphs
- Maintenance of 2- and 3-Edge-Connected Components of Graphs II
- Augmenting the Connectivity of Planar and Geometric Graphs
- On the Hardness and Approximability of Planar Biconnectivity Augmentation
This page was built for publication: Augmenting the edge connectivity of planar straight line graphs to three
