Ordering Metro Lines by Block Crossings

DOI10.1007/978-3-642-40313-2_36zbMath1398.68395arXiv1305.0069OpenAlexW2167397124MaRDI QIDQ2849928

Sergey Pupyrev, Martin Fink

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.0069

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Edge routing with ordered bundles ⋮ Parameterized analysis and crossing minimization problems

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