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

David Coudert, Guillaume Ducoffe, Alexandru Popa

Parameterized complexity theory has enabled a refined classification of the difficulty of NP-hard optimization problems on graphs with respect to key structural properties, and so…