Tight complexity bounds for FPT subgraph problems parameterized by the clique-width

Haitze J. Broersma, Petr A. Golovach, Viresh Patel

Research output: Contribution to journalArticleAcademicpeer-review

16 Citations (Scopus)
3 Downloads (Pure)

Fingerprint

Dive into the research topics of 'Tight complexity bounds for FPT subgraph problems parameterized by the clique-width'. Together they form a unique fingerprint.