On Hardness of the Joint Crossing Number
From MaRDI portal
Publication:3459898
DOI10.1007/978-3-662-48971-0_51zbMath1472.68115arXiv1509.01787OpenAlexW2963463550MaRDI QIDQ3459898
Publication date: 11 January 2016
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.01787
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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Parameterized analysis and crossing minimization problems ⋮ Low-dimensional topology. Abstracts from the workshop held January 15--21, 2023
This page was built for publication: On Hardness of the Joint Crossing Number
