We give tight algorithmic lower and upper bounds for some double-parameterized subgraph problems when the clique-width of the input graph is one of the parameters.
- Parameterized complexity
- Subgraph problems
- Exponential time hypothesis
Broersma, H. J., Golovach, P. A., & Patel, V. (2013). Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theoretical computer science, 485, 69-84. https://doi.org/10.1016/j.tcs.2013.03.008