# Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs

> Research article (ACM Transactions on Algorithms, 2019) · cited 48× · AI/ML

**Wikidata**: [openalex:W2949142592](https://www.wikidata.org/wiki/openalex:W2949142592)  
**Source**: https://4ort.xyz/entity/fully-polynomial-fpt-algorithms-for-some-classes-of-bounded-clique-width-graphs