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.

• Type: Journal
• Year: 2010
• Where: IWOCA
• Authors: Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry
• Keywords: Algorithms, IWOCA 2010, Path-based Support, Path-based Tree Support, Planar Path-based Support