Path-based supports for hypergraphs
From MaRDI portal
Recommendations
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
(18)- On planar supports for hypergraphs
- Colored spanning graphs for set visualization
- Minimum tree supports for hypergraphs and low-concurrency Euler diagrams
- C-planarity testing of embedded clustered graphs with bounded dual carving-width
- Decomposing the feasibility of clustered spanning tree by paths
- Using the metro-map metaphor for drawing hypergraphs
- Vertices removal for feasibility of clustered spanning trees
- Emergence and dynamics of short food supply chains
- Short plane supports for spatial hypergraphs
- Faster algorithms for the minimum red-blue-purple spanning graph problem
- The role of twins in computing planar supports of hypergraphs
- Short plane supports for spatial hypergraphs
- Twins in Subdivision Drawings of Hypergraphs
- Blocks of hypergraphs. Applied to hypergraphs and outerplanarity
- Path-based supports for hypergraphs
- On planar supports for hypergraphs
- Representing graphs and hypergraphs by touching polygons in 3D
- Placing green bridges optimally, with a multivariate analysis
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)