Skip to Main content Skip to Navigation
Conference papers

Path-Based Supports for Hypergraphs

Ulrik Brandes 1 Sabine Cornelsen 1 Barbara Pampel 1 Arnaud Sallaberry 2, 3, 4, *
* Corresponding author
3 GRAVITE - Graph Visualization and Interactive Exploration
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Arnaud Sallaberry <>
Submitted on : Thursday, December 2, 2010 - 4:45:34 PM
Last modification on : Tuesday, February 9, 2021 - 3:14:04 PM
Long-term archiving on: : Monday, November 5, 2012 - 11:05:36 AM


Files produced by the author(s)


  • HAL Id : hal-00538984, version 1



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⟩



Record views


Files downloads