Augmenting the connectivity of outerplanar graphs

DOI10.1007/s00453-008-9167-1zbMath1231.05158OpenAlexW2056304816MaRDI QIDQ848960

Ferran Hurtado, Alfredo Daniel Garcia, Marc Noy, F. Javier Tejel

Publication date: 23 February 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9167-1

zbMATH Keywords

graph augmentationouterplanar graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items

IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION ⋮ B0-VPG Representation of AT-free Outerplanar Graphs ⋮ Compatible spanning trees ⋮ Augmenting the edge connectivity of planar straight line graphs to three ⋮ Connectivity augmentation in planar straight line graphs ⋮ 2-connecting outerplanar graphs without blowing up the pathwidth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-connectivity augmentation problems
• Successive edge-connectivity augmentation problems
• Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs
• Independence free graphs and vertex connectivity augmentation
• A smallest augmentation to 3-connect a graph
• Packing trees into planar graphs
• Augmentation Problems
• An Analytical Solution of Vector Diffraction for Focusing Optical Systems
• Augmenting Outerplanar Graphs