Train tracks and confluent drawings

DOI10.1007/s00453-006-0165-xzbMath1118.68104OpenAlexW2143158031MaRDI QIDQ879959

Marcus Schaefer, Michael J. Pelsmajer, Peter Hui, Daniel Štefanković

Publication date: 10 May 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-006-0165-x

zbMATH Keywords

planar graphsbipartite permutation

Mathematics Subject Classification ID

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

Related Items (5)

On Strict (Outer-)Confluent Graphs ⋮ Approximating the Bundled Crossing Number ⋮ On strict (outer-)confluent graphs ⋮ Confluent Hasse Diagrams ⋮ Crossing Layout in Non-planar Graph Drawings

This page was built for publication: Train tracks and confluent drawings