The Almost-Disjoint 2-Path Decomposition Problem
Abstract
We consider the problem of decomposing a given (di)graph into paths of length 2 with the additional restriction that no two such paths may have more than one vertex in common. We establish its NP-hardness by a reduction from 3-SAT, characterize (di)graph classes for which the problem can be be reduced to the Stable-set problem on claw-free graphs and describe a dynamic program for solving it for series-parallel digraphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.