Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs

DOI10.1137/1.9781611973105.65zbMath1422.68178OpenAlexW4251311582MaRDI QIDQ5741773

Norbert Zeh, Lars Arge, Freek Van Walderveen

Publication date: 15 May 2019

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

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Optimal decremental connectivity in planar graphs, Faster shortest paths in dense distance graphs, with applications, Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os, An efficient oracle for counting shortest paths in planar graphs, Contracting a Planar Graph Efficiently, An efficient oracle for counting shortest paths in planar graphs, Short and Simple Cycle Separators in Planar Graphs