The f-Critical Set problem is NP-complete on planar subcubic bipartite graphs with m(f)=2, W[1]-hard parameterized by treewidth alone, yet FPT parameterized by treewidth plus m(f) or Δ(G), with kernels of size O(k·m(f)) and O(k·Δ(G)).
Replacing suffix tr ees with enhanced suffix arrays
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
A survey of string covering techniques including covers and seeds, with proposals for future research directions in combinatorial string algorithms.
citing papers explorer
-
Parameterized complexity of the f-Critical Set problem
The f-Critical Set problem is NP-complete on planar subcubic bipartite graphs with m(f)=2, W[1]-hard parameterized by treewidth alone, yet FPT parameterized by treewidth plus m(f) or Δ(G), with kernels of size O(k·m(f)) and O(k·Δ(G)).
-
String Covering: A Survey
A survey of string covering techniques including covers and seeds, with proposals for future research directions in combinatorial string algorithms.