Using the metro-map metaphor for drawing hypergraphs

DOI10.1007/978-3-030-67731-2_26MaRDI QIDQ831834zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• HYPERMETRIC GRAPHS
• scientific article; zbMATH DE number 2080095
• Succinct Greedy Graph Drawing in the Hyperbolic Plane
• On Metapaths in Metagraphs
• Orthogonal Hypergraph Drawing for Improved Visibility
• Subdivision Drawings of Hypergraphs
• GraphMaps: browsing large graphs as interactive maps
• Multi-level graph drawing using infomap clustering
• Self-organizing maps for drawing large graphs

Cites work

• An improved algorithm for the metro-line crossing minimization problem
• Atomic embeddability, clustered planarity, and thickenability
• Hierarchical planarity testing algorithms
• On metro-line crossing minimization
• Ordering metro lines by block crossings
• Path-based supports for hypergraphs
• Planarity for clustered graphs

Cited in

(1)

• Graph Drawing

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

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