For the dual parameter ℓ, CGM is SETH-hard to improve beyond 2^ℓ on general graphs, LGM is W[1]-hard even with lists of size two, and tree inputs admit an O(3^ℓ) algorithm for GM, an O(√2^ℓ) algorithm and linear kernel for CGM.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Graph Motif Problems Parameterized by Dual
For the dual parameter ℓ, CGM is SETH-hard to improve beyond 2^ℓ on general graphs, LGM is W[1]-hard even with lists of size two, and tree inputs admit an O(3^ℓ) algorithm for GM, an O(√2^ℓ) algorithm and linear kernel for CGM.