An Improved Algorithm for the Metro-line Crossing Minimization Problem

DOI10.1007/978-3-642-11805-0_36zbMath1284.68472OpenAlexW1582542512MaRDI 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

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

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

This page was built for publication: An Improved Algorithm for the Metro-line Crossing Minimization Problem