An improved algorithm for the metro-line crossing minimization problem

DOI10.1007/978-3-642-11805-0_36MaRDI QIDQ3557894zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
• On metro-line crossing minimization
• Line Crossing Minimization on Metro Maps
• Metro-line crossing minimization: hardness, approximations, and tractable cases
• Ordering metro lines by block crossings

Cited in

(10)

• Edge routing with ordered bundles
• Metro-line crossing minimization: hardness, approximations, and tractable cases
• Path-based supports for hypergraphs
• Edge routing with ordered bundles
• On metro-line crossing minimization
• Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
• Path-based supports for hypergraphs
• Line Crossing Minimization on Metro Maps
• A simple pipeline for orthogonal graph drawing
• Using the metro-map metaphor for drawing hypergraphs

This page was built for publication: An improved algorithm for the metro-line crossing minimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557894)