Zobrazeno 1 - 1
of 1
pro vyhledávání: '"N, Rajath Rao K."'
We study the algorithmic complexity of partitioning the vertex set of a given (di)graph into a small number of paths. The Path Partition problem (PP) has been studied extensively, as it includes Hamiltonian Path as a special case. The natural variant
Externí odkaz:
http://arxiv.org/abs/2212.11653
