Advertisement
Published in:
2011 | OriginalPaper | Chapter
Path-Based Supports for Hypergraphs
Authors : Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry
Published in: Combinatorial Algorithms
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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
$\mathcal N\mathcal P$
-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.