Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model

DOI10.1007/978-3-662-44777-2_14zbMath1423.68204arXiv1405.2300OpenAlexW133636673MaRDI QIDQ2921402

Guido Brückner, Thomas Bläsius, Ignaz Rutter

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

Planar L-Drawings of Bimodal Graphs ⋮ Optimal-area visibility representations of outer-1-plane graphs ⋮ Planar Confluent Orthogonal Drawings of 4-Modal Digraphs ⋮ Planar confluent orthogonal drawings of 4-modal digraphs ⋮ Planar L-Drawings of Directed Graphs ⋮ Crossing Layout in Non-planar Graph Drawings ⋮ Planar L-Drawings of Bimodal Graphs

This page was built for publication: Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model