Path-based supports for hypergraphs

DOI10.1016/J.JDA.2011.12.009MaRDI QIDQ450570zbMATH OpenOpenAlexFDO

Authors Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry, 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

graph algorithmhypergraphgraph drawingmetro map layout

Mathematics Subject Classification ID

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

Recommendations

• Path-based supports for hypergraphs
• On planar supports for hypergraphs
• On planar supports for hypergraphs
• Short plane supports for spatial hypergraphs
• Blocks of hypergraphs. Applied to hypergraphs and outerplanarity

Cites work

• An improved algorithm for the metro-line crossing minimization problem
• Blocks of hypergraphs. Applied to hypergraphs and outerplanarity
• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• Hypergraph planarity and the complexity of drawing venn diagrams
• Mixed hypercacti
• Monotone drawings of graphs
• On planar supports for hypergraphs
• On the Desirability of Acyclic Database Schemes
• Path-based supports for hypergraphs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Subdivision Drawings of Hypergraphs
• The clustering matroid and the optimal clustering tree
• Total Ordering Problem

Cited in

(21)

• Decomposing the feasibility of clustered spanning tree by paths
• Short plane supports for spatial hypergraphs
• Using the metro-map metaphor for drawing hypergraphs
• On hypergraph supports (extended abstract)
• Emergence and dynamics of short food supply chains
• Path-based supports for hypergraphs
• Twins in Subdivision Drawings of Hypergraphs
• The role of twins in computing planar supports of hypergraphs
• On planar supports for hypergraphs
• Representing graphs and hypergraphs by touching polygons in 3D
• On the complexity of community-aware network sparsification
• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• Vertices removal for feasibility of clustered spanning trees
• Placing green bridges optimally, with a multivariate analysis
• Blocks of hypergraphs. Applied to hypergraphs and outerplanarity
• A fast algorithm for computing a planar support for non-piercing rectangles
• Colored spanning graphs for set visualization
• On planar supports for hypergraphs
• Short plane supports for spatial hypergraphs
• Minimum tree supports for hypergraphs and low-concurrency Euler diagrams
• Faster algorithms for the minimum red-blue-purple spanning graph problem

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

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