Star Decomposition is para-NP-hard for several structural parameters, W[1]-hard for vertex cover number, FPT for (vc,d), (td,s), and (nd,s), and XP for treewidth and vc.
Graph decomposition is np-complete: A complete proof of holyer's conjecture
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Parameterized Complexity of the Star Decomposition Problem
Star Decomposition is para-NP-hard for several structural parameters, W[1]-hard for vertex cover number, FPT for (vc,d), (td,s), and (nd,s), and XP for treewidth and vc.