Path-based supports for hypergraphs

Authors:
Ulrik Brandes;Sabine Cornelsen;Barbara Pampel;Arnaud Sallaberry
Affiliations:
Department of Computer and Information Science, University of Konstanz, Box 67, 78457 Konstanz, Germany;Department of Computer and Information Science, University of Konstanz, Box 67, 78457 Konstanz, Germany;Department of Computer and Information Science, University of Konstanz, Box 67, 78457 Konstanz, Germany;CNRS UMR 5800 LaBRI, INRIA Bordeaux - Sud Ouest, Pikko, 351, cours de la Libration, 33405 Talence Cedex, France
Venue:
Journal of Discrete Algorithms
Year:
2012

Citing 11
Cited 1

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
Monotone drawings of graphs

GD'10 Proceedings of the 18th international conference on Graph drawing
Path-based supports for hypergraphs

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
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

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 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-hard to decide whether a path-based support has a monotone drawing, to determine 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.