Clustered Planarity Testing Revisited

DOI10.1007/978-3-662-45803-7_36zbMath1427.05061arXiv1305.4519OpenAlexW2964341265MaRDI QIDQ2936950

Jan Kynčl, Igor Malinović, Dömötör Pálvölgyi, Radoslav Fulek

Publication date: 7 January 2015

Published in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.4519

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (5)

Towards the Hanani-Tutte Theorem for Clustered Graphs ⋮ Clustered planarity testing revisited ⋮ Hanani-Tutte for approximating maps of graphs ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Beyond Clustered Planar Graphs

This page was built for publication: Clustered Planarity Testing Revisited