An Improved Algorithm for the Metro-line Crossing Minimization Problem

DOI10.1007/978-3-642-11805-0_36zbMath1284.68472MaRDI QIDQ3557894

Martin Nöllenburg

Publication date: 27 April 2010

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11805-0_36

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68R10: Graph theory (including graph drawing) in computer science

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

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Edge routing with ordered bundles, Path-based supports for hypergraphs, Using the metro-map metaphor for drawing hypergraphs, An algorithmic framework for labeling network maps, Path-Based Supports for Hypergraphs, Edge Routing with Ordered Bundles