Blocks of Hypergraphs
From MaRDI portal
Publication:3000508
DOI10.1007/978-3-642-19222-7_21zbMath1326.05098MaRDI QIDQ3000508
Barbara Pampel, Ulrik Brandes, Arnaud Sallaberry, Sabine Cornelsen
Publication date: 19 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_21
68Q25: Analysis of algorithms and problem complexity
05C65: Hypergraphs
05C10: Planar graphs; geometric and topological aspects of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Overlaying a hypergraph with a graph with bounded maximum degree, Path-based supports for hypergraphs, Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem, C-planarity testing of embedded clustered graphs with bounded dual carving-width, Twins in Subdivision Drawings of Hypergraphs, Path-Based Supports for Hypergraphs
Cites Work
- Hypermaps versus bipartite maps
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The clustering matroid and the optimal clustering tree
- Mixed hypercacti
- Diagrammatic representation and inference. Third international conference, Diagrams 2004, Cambridge, UK, March 22--24, 2004. Proceedings.
- Decidability of string graphs
- 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
- How to draw a hypergraph
- Subdivision Drawings of Hypergraphs
- Hypergraph planarity and the complexity of drawing venn diagrams
- Efficient Planarity Testing
- Orthogonal Hypergraph Drawing for Improved Visibility
- Overlapping Cluster Planarity
- Algorithms for the Hypergraph and the Minor Crossing Number Problems
- Diagrammatic Representation and Inference
- Diagrammatic Representation and Inference
- On Planar Supports for Hypergraphs
- Graph Drawing
- On Planar Supports for Hypergraphs