Simultaneous Embeddability of Two Partitions

DOI10.1007/978-3-662-45803-7_6zbMath1426.68268arXiv1408.6019MaRDI QIDQ2936915

Martin Nöllenburg, Jan Christoph Athenstädt, Tanja Hartmann

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/1408.6019

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C65: Hypergraphs

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

C-planarity testing of embedded clustered graphs with bounded dual carving-width