Algorithms and bounds for path covers of tree-structured graphs
Dutta, Madhura · Foucaud, Florent · Nandy, Subhas
The path cover problem is a natural graph covering problem that generalizes the Hamiltonian path problem. Given an input graph, it requires to find a minimum-size set of (not necessarily disjoint) paths that cover all the vertices of the graph. In this paper, we give two lower bounds for the path cover number in genera...
- Array
- France
- English