Compatible Connectivity-Augmentation of Planar Disconnected Graphs

DOI10.1137/1.9781611973730.106zbMath1371.05051OpenAlexW2952959227MaRDI QIDQ5363015

Paz Carmi, Vida Dujmović, Pat Morin, Fabrizio Frati, Greg Aloupis, 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

Analysis of algorithms and problem complexity (68Q25) 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)

Related Items (max. 100)

Strip planarity testing for embedded planar graphs

This page was built for publication: Compatible Connectivity-Augmentation of Planar Disconnected Graphs