Ordering Metro Lines by Block Crossings

DOI10.7155/jgaa.00351zbMath1307.05212OpenAlexW2091774190MaRDI QIDQ5176859

Sergey Pupyrev, Martin Fink, Alexander Wolff

Publication date: 4 March 2015

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00351

zbMATH Keywords

drawings of transportation networks

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (7)

Using the metro-map metaphor for drawing hypergraphs ⋮ Approximating the Bundled Crossing Number ⋮ Block Crossings in Storyline Visualizations ⋮ The Bundled Crossing Number ⋮ Block crossings in one-sided tanglegrams ⋮ Bundled crossings revisited ⋮ Bundled Crossings Revisited

This page was built for publication: Ordering Metro Lines by Block Crossings