Graph Drawing
From MaRDI portal
Publication:5897641
DOI10.1007/11618058zbMath1171.68637OpenAlexW4251892597MaRDI QIDQ5897641
Martin Nöllenburg, Alexander Wolff
Publication date: 13 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11618058
Mixed integer programming (90C11) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
On the Hardness of Orthogonal-Order Preserving Graph Drawing ⋮ Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem ⋮ Line Crossing Minimization on Metro Maps ⋮ On d-Regular Schematization of Embedded Paths
This page was built for publication: Graph Drawing
