Path-Based Supports for Hypergraphs

Ulrik Brandes (1) , Sabine Cornelsen (1) , Barbara Pampel (1) , Arnaud Sallaberry (2, 3, 4)

1 Department of Computer and Information Science, University of Konstanz
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique
3 GRAVITE - Graph Visualization and Interactive Exploration
4 PIKKO

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.

Domaines: Algorithme et structure de données [cs.DS]

Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry. Path-Based Supports for Hypergraphs. 21st International Workshop on Combinatorial Algorithms (IWOCA 2010), Jul 2010, United Kingdom. pp.20-33. ⟨hal-00538984⟩