Blocks of hypergraphs: applied to hypergraphs and outerplanarity

Authors:
Ulrik Brandes;Sabine Cornelsen;Barbara Pampel;Arnaud Sallaberry
Affiliations:
Fachbereich Informatik & Informationswissenschaft, Universität Konstanz;Fachbereich Informatik & Informationswissenschaft, Universität Konstanz;Fachbereich Informatik & Informationswissenschaft, Universität Konstanz;CNRS UMR 5800 LaBRI, INRIA Bordeaux - Sud Ouest, Pikko
Venue:
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Year:
2010

Citing 13
Cited 4

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
Efficient Planarity Testing

Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Decidability of string graphs

Journal of Computer and System Sciences - STOC 2001
Graphs and Hypergraphs

Graphs and Hypergraphs
Generating and drawing area-proportional euler and venn diagrams

Generating and drawing area-proportional euler and venn diagrams
Visualise Undrawable Euler Diagrams

IV '08 Proceedings of the 2008 12th International Conference Information Visualisation
Euler diagram generation

Journal of Visual Languages and Computing
Subdivision Drawings of Hypergraphs

Graph Drawing
An Heuristic for the Construction of Intersection Graphs

IV '09 Proceedings of the 2009 13th International Conference Information Visualisation
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
Algorithms for the hypergraph and the minor crossing number problems

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
On planar supports for hypergraphs

GD'09 Proceedings of the 17th international conference on Graph Drawing

Path-based supports for hypergraphs

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Path-based supports for hypergraphs

Journal of Discrete Algorithms
Kelp Diagrams: Point Set Membership Visualization

Computer Graphics Forum
Visual analysis of set relations in a graph

EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

A support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a connected subgraph. We show how to test in polynomial time whether a given hypergraph has a cactus support, i.e. a support that is a tree of edges and cycles. While it is NP-complete to decide whether a hypergraph has a 2-outerplanar support, we show how to test in polynomial time whether a hypergraph that is closed under intersections and differences has an outerplanar or a planar support. In all cases our algorithms yield a construction of the required support if it exists. The algorithms are based on a new definition of biconnected components in hypergraphs.