A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem

DOI10.1007/978-3-662-45803-7_37zbMath1426.68269OpenAlexW2963573247MaRDI QIDQ2936952

Thomas Blösius, Ignaz Rutter

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://doi.org/10.1007/978-3-662-45803-7_37

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

\(c\)-planarity of embedded cyclic \(c\)-graphs ⋮ Simpler algorithms for testing two-page book embedding of partitioned graphs ⋮ Embedding Graphs into Embedded Graphs

This page was built for publication: A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem