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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Brandes, U., Cornelsen, S., Pampel, B., & Sallaberry, A. (2011). Path-based supports for hypergraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6460 LNCS, pp. 20–33). https://doi.org/10.1007/978-3-642-19222-7_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
