A Near-Optimal Planarization Algorithm

DOI10.1137/1.9781611973402.130zbMath1423.68341MaRDI QIDQ5384092

Saket Saurabh, Daniel Lokshtanov, Bart M. P. Jansen

Publication date: 20 June 2019

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

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

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

05C10: Planar graphs; geometric and topological aspects of graph theory

05C85: Graph algorithms (graph-theoretic aspects)