Compatible connectivity-augmentation of planar disconnected graphs

DOI10.1137/1.9781611973730.106MaRDI QIDQ5363015zbMATH OpenOpenAlexFDO

Authors Greg Aloupis, Paz Carmi, Vida Dujmović, Fabrizio Frati, Pat Morin, Luis Barba

Publication date 5 October 2017

Published in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973730.106

Mathematics Subject Classification ID

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

Recommendations

• Compatible connectivity augmentation of planar disconnected graphs
• Augmenting the connectivity of planar and geometric graphs
• Connectivity augmentation in planar straight line graphs
• Augmenting the connectivity of planar and geometric graphs
• Connectivity augmentation in plane straight line graphs

Cited in

(3)

• Strip planarity testing for embedded planar graphs
• Augmenting the connectivity of outerplanar graphs
• Compatible connectivity augmentation of planar disconnected graphs

This page was built for publication: Compatible connectivity-augmentation of planar disconnected graphs

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