Path-based supports for hypergraphs
From MaRDI portal
Publication:3000490
DOI10.1007/978-3-642-19222-7_3zbMATH Open1295.05166OpenAlexW2178495230MaRDI QIDQ3000490FDOQ3000490
Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry
Publication date: 19 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://nbn-resolving.de/urn:nbn:de:bsz:352-179948
Cites Work
- The clustering matroid and the optimal clustering tree
- An Improved Algorithm for the Metro-line Crossing Minimization Problem
- 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
- Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
- Mixed hypercacti
- Blocks of Hypergraphs
- Subdivision Drawings of Hypergraphs
- Hypergraph planarity and the complexity of drawing venn diagrams
- On Planar Supports for Hypergraphs
Cited In (2)
Recommendations
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 Q3000490)