Abstract
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.
Original language | Undefined |
---|---|
Pages (from-to) | 69-84 |
Number of pages | 16 |
Journal | Theoretical computer science |
Volume | 485 |
DOIs | |
Publication status | Published - 2013 |
Keywords
- MSC-05C
- Parameterized complexity
- Subgraph problems
- IR-86132
- Clique-width
- Exponential time hypothesis
- METIS-297655
- EWI-23371