Short plane supports for spatial hypergraphs
From MaRDI portal
Recommendations
Cites work
- Colored Non-crossing Euclidean Steiner Forest
- Colored spanning graphs for set visualization
- Hypergraph planarity and the complexity of drawing venn diagrams
- MapSets: visualizing embedded and clustered graphs
- Minimum tree supports for hypergraphs and low-concurrency Euler diagrams
- On planar supports for hypergraphs
- On the red/blue spanning tree problem
- Path-based supports for hypergraphs
- Planar Formulae and Their Uses
- Short plane supports for spatial hypergraphs
- The clustering matroid and the optimal clustering tree
- The painter's problem: covering a grid with colored connected polygons
Cited in
(10)- Short plane supports for spatial hypergraphs
- Existence of planar support for geometric hypergraphs using elementary techniques
- Constructing planar support for non-piercing regions
- Path-based supports for hypergraphs
- Blocks of hypergraphs. Applied to hypergraphs and outerplanarity
- Minimum tree supports for hypergraphs and low-concurrency Euler diagrams
- Path-based supports for hypergraphs
- On planar supports for hypergraphs
- On planar supports for hypergraphs
- A (5/3+)-approximation for tricolored non-crossing Euclidean TSP
This page was built for publication: Short plane supports for spatial hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233132)
