Sciweavers

Share
IWOCA
2010
Springer

Path-Based Supports for Hypergraphs

9 years 1 months ago
Path-Based Supports for Hypergraphs
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.
Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, A
Added 19 May 2011
Updated 19 May 2011
Type Journal
Year 2010
Where IWOCA
Authors Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry
Comments (0)
books