WMCS on treewidth-tw graphs is solvable in 3^{c(tw+1)} n^{tw+O(1)}, with matching ETH lower bounds and a single-exponential 5^{vc} algorithm for unweighted MCS.
The complexity landscape of decompositional parame- ters for ILP.Artif
1 Pith paper cite this work, alongside 13 external citations. Polarity classification is still indexing.
1
Pith paper citing it
13
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset
WMCS on treewidth-tw graphs is solvable in 3^{c(tw+1)} n^{tw+O(1)}, with matching ETH lower bounds and a single-exponential 5^{vc} algorithm for unweighted MCS.