Fingerprint
Dive into the research topics of 'Tight complexity bounds for FPT subgraph problems parameterized by clique-width'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Tight complexity bounds for FPT subgraph problems parameterized by clique-width
Haitze J. Broersma, Petr A. Golovach, Viresh Patel
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
3
Citations
(Scopus)
49
Downloads
(Pure)