Path-based supports for hypergraphs

DOI10.1016/j.jda.2011.12.009zbMath1247.05235OpenAlexW2088792563MaRDI QIDQ450570

Arnaud Sallaberry, Barbara Pampel, Sabine Cornelsen, Ulrik Brandes

Publication date: 13 September 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.12.009

zbMATH Keywords

hypergraphgraph algorithmgraph drawingmetro map layout

Mathematics Subject Classification ID

Applications of graph theory (05C90) Hypergraphs (05C65) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (11)

Using the metro-map metaphor for drawing hypergraphs ⋮ Vertices removal for feasibility of clustered spanning trees ⋮ Twins in Subdivision Drawings of Hypergraphs ⋮ Colored spanning graphs for set visualization ⋮ Representing graphs and hypergraphs by touching polygons in 3D ⋮ Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem ⋮ Short plane supports for spatial hypergraphs ⋮ Emergence and dynamics of short food supply chains ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Short Plane Supports for Spatial Hypergraphs ⋮ Multi-colored spanning graphs

Cites Work

• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• The clustering matroid and the optimal clustering tree
• Mixed hypercacti
• Path-Based Supports for Hypergraphs
• Blocks of Hypergraphs
• On the Desirability of Acyclic Database Schemes
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• An Improved Algorithm for the Metro-line Crossing Minimization Problem
• Subdivision Drawings of Hypergraphs
• Hypergraph planarity and the complexity of drawing venn diagrams
• Total Ordering Problem
• Monotone Drawings of Graphs
• On Planar Supports for Hypergraphs

This page was built for publication: Path-based supports for hypergraphs