Establishes NP-hardness of the almost-disjoint 2-path decomposition problem and gives polynomial algorithms for certain graph classes.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Almost-Disjoint 2-Path Decomposition Problem
Establishes NP-hardness of the almost-disjoint 2-path decomposition problem and gives polynomial algorithms for certain graph classes.