Path-Based Supports for Hypergraphs
Résumé
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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...