Fully polynomial FPT algorithms for some classes of bounded clique-width graphs

David Coudert, Guillaume Ducoffe, Alexandru Popa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Citations (Scopus)

Fingerprint Dive into the research topics of 'Fully polynomial FPT algorithms for some classes of bounded clique-width graphs'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science