Engineering planar separator algorithms

DOI10.1145/1498698.1571635zbMath1284.05290OpenAlexW2152486395MaRDI QIDQ5406197

Martin Holzer, Grigorios Prasinos, Dorothea Wagner, Frank Schulz, Christos D. Zaroliagis

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://publikationen.bibliothek.kit.edu/1000003518

zbMATH Keywords

planar graphdivide-and-conquerseparator

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

Fission: Practical algorithms for computing minimum balanced node separators ⋮ Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators ⋮ Efficient heuristic algorithm for identifying critical nodes in planar networks ⋮ Balanced line separators of unit disk graphs ⋮ Short and Simple Cycle Separators in Planar Graphs