Practical Experience with Hanani-Tutte for Testing c-Planarity
From MaRDI portal
Publication:5232494
DOI10.1137/1.9781611973198.9zbMath1430.68212OpenAlexW2290811409WikidataQ56976994 ScholiaQ56976994MaRDI QIDQ5232494
Marcus Schaefer, Carsten Gutwenger, Petra Mutzel
Publication date: 12 September 2019
Published in: 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973198.9
Graph polynomials (05C31) 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 (5)
Hanani--Tutte and Hierarchical Partial Planarity ⋮ Clustered planarity testing revisited ⋮ Clustered planarity = flat clustered planarity ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Beyond Clustered Planar Graphs
This page was built for publication: Practical Experience with Hanani-Tutte for Testing c-Planarity