Blocks of Hypergraphs

DOI10.1007/978-3-642-19222-7_21zbMATH Open1326.05098OpenAlexW1580460466MaRDI QIDQ3000508FDOQ3000508

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Hypergraphs (05C65)

Cites Work

• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The clustering matroid and the optimal clustering tree
• Efficient Planarity Testing
• 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
• Hypermaps versus bipartite maps
• Mixed hypercacti
• Subdivision Drawings of Hypergraphs
• Hypergraph planarity and the complexity of drawing venn diagrams
• On Planar Supports for Hypergraphs
• Decidability of string graphs
• On planar supports for hypergraphs
• Diagrammatic Representation and Inference
• Graph Drawing
• Orthogonal Hypergraph Drawing for Improved Visibility
• Diagrammatic representation and inference. Third international conference, Diagrams 2004, Cambridge, UK, March 22--24, 2004. Proceedings.
• Diagrammatic Representation and Inference
• How to draw a hypergraph
• Algorithms for the Hypergraph and the Minor Crossing Number Problems
• Overlapping Cluster Planarity

Cited In (12)

• Decomposing the feasibility of clustered spanning tree by paths
• Path-based supports for hypergraphs
• Twins in Subdivision Drawings of Hypergraphs
• Title not available (Why is that?)
• The role of twins in computing planar supports of hypergraphs
• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• Overlaying a hypergraph with a graph with bounded maximum degree
• More on block intersection polynomials and new applications to graphs and block designs
• Hypergraph edge representations with the use of homological paths
• On the cut-vertex and the interval transit functions of hypergraphs
• Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem
• Path-Based Supports for Hypergraphs

This page was built for publication: Blocks of Hypergraphs

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