Path-based supports for hypergraphs

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 9
Cited 2

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

SIAM Journal on Computing
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Compressing large boolean matrices using reordering techniques

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Euler diagram generation

Journal of Visual Languages and Computing
Subdivision Drawings of Hypergraphs

Graph Drawing
Blocks of hypergraphs: applied to hypergraphs and outerplanarity

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
On planar supports for hypergraphs

GD'09 Proceedings of the 17th international conference on Graph Drawing
An improved algorithm for the metro-line crossing minimization problem

GD'09 Proceedings of the 17th international conference on Graph Drawing
Fully automatic visualisation of overlapping sets

EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization

Path-based supports for hypergraphs

Journal of Discrete Algorithms
Kelp Diagrams: Point Set Membership Visualization

Computer Graphics Forum

Quantified Score

Hi-index	0.00

Visualization

Abstract

A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-based support with the minimum number of edges or to decide whether there is a planar path-based support, we show that a path-based tree support can be computed in polynomial time if it exists.