Train tracks and confluent drawings

DOI10.1007/S00453-006-0165-XMaRDI QIDQ879959zbMATH OpenOpenAlexFDO

Authors Peter Hui, Michael J. Pelsmajer, Marcus Schaefer, D. Š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)

Recommendations

• Graph Drawing
• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
• Graph Drawing
• Graph Drawing
• Strict confluent drawing

Cited in

(9)

• Graph Drawing
• Vickrey Auctions for Railway Tracks
• Graph Drawing
• On strict (outer-)confluent graphs
• Using Graph Layout to Visualize Train Interconnection Data
• On strict (outer-)confluent graphs
• Confluent Hasse Diagrams
• Approximating the Bundled Crossing Number
• Crossing Layout in Non-planar Graph Drawings

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

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