Augmenting the connectivity of outerplanar graphs
DOI10.1007/S00453-008-9167-1zbMATH Open1231.05158OpenAlexW2056304816MaRDI QIDQ848960FDOQ848960
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
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
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Augmentation Problems
- Packing trees into planar graphs
- Independence free graphs and vertex connectivity augmentation
- A smallest augmentation to 3-connect a graph
- Edge-connectivity augmentation problems
- Title not available (Why is that?)
- Augmenting Outerplanar Graphs
- Successive edge-connectivity augmentation problems
- Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs
- An Analytical Solution of Vector Diffraction for Focusing Optical Systems
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)
