k-Level Crossing Minimization Is NP-Hard for Trees
From MaRDI portal
Publication:3078383
DOI10.1007/978-3-642-19094-0_9zbMath1317.68057MaRDI QIDQ3078383
Martin Harrigan, Patrick Healy
Publication date: 20 February 2011
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19094-0_9
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Cites Work