Augmenting the connectivity of outerplanar graphs

DOI10.1007/S00453-008-9167-1MaRDI QIDQ848960zbMATH OpenOpenAlexFDO

Authors Alfredo García, Ferran Hurtado, Marc Noy, 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

outerplanar graphgraph augmentation

Mathematics Subject Classification ID

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

Recommendations

• Augmenting Outerplanar Graphs
• Augmenting the connectivity of planar and geometric graphs
• Augmenting the connectivity of planar and geometric graphs
• Augmenting the connectivity of geometric graphs
• Augmenting outerplanar graphs to meet diameter requirements
• Connectivity augmentation in planar straight line graphs
• Connectivity augmentation in plane straight line graphs
• Connectivity augmentation of graphs
• Compatible connectivity augmentation of planar disconnected graphs
• Compatible connectivity-augmentation of planar disconnected graphs

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1256642 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• A smallest augmentation to 3-connect a graph
• An Analytical Solution of Vector Diffraction for Focusing Optical Systems
• Augmentation Problems
• Augmenting Outerplanar Graphs
• Deterministic O(nm) time edge-splitting in undirected graphs
• Edge-connectivity augmentation problems
• Independence free graphs and vertex connectivity augmentation
• Packing trees into planar graphs
• Successive edge-connectivity augmentation problems

Cited in

(8)

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

This page was built for publication: Augmenting the connectivity of outerplanar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848960)