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

10 Citations (Scopus)

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.