Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem

DOI10.1007/978-3-642-00219-9_33zbMath1213.68647MaRDI QIDQ3611868

Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Evmorfia N. Argyriou

Publication date: 3 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_33

Mathematics Subject Classification ID

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

05C10: Planar graphs; geometric and topological aspects of graph theory

05C85: Graph algorithms (graph-theoretic aspects)

05C62: Graph representations (geometric and intersection representations, etc.)

Cites Work

• Unnamed Item
• Path Simplification for Metro Map Layout
• Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps
• Line Crossing Minimization on Metro Maps
• Graph Drawing
• Graph Drawing