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 proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)
71 Downloads (Pure)

Fingerprint

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

Mathematics

Computer Science