Using the metro-map metaphor for drawing hypergraphs

DOI10.1007/978-3-030-67731-2_26zbMath1490.68153OpenAlexW3123110313MaRDI QIDQ831834

N. E. Zubov

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_26

zbMATH Keywords

NP-hardnesscrossing minimizationclustered planarityhypergraph visualizationmetro-map metaphor

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Path-based supports for hypergraphs
• On Metro-Line Crossing Minimization
• An Improved Algorithm for the Metro-line Crossing Minimization Problem
• Hierarchical planarity testing algorithms
• Atomic Embeddability, Clustered Planarity, and Thickenability
• Ordering Metro Lines by Block Crossings
• Planarity for clustered graphs

This page was built for publication: Using the metro-map metaphor for drawing hypergraphs