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

David Coudert Guillaume Ducoffe Alexandru Popa

Published in: SODA (2018)

Keyphrases

graph theory
significant improvement
computational cost
learning algorithm
optimization problems
data structure
computational complexity
special case
graph theoretic
worst case
maximal clique enumeration
maximum clique
maximal cliques
directed graph
theoretical analysis
lower bound
optimal solution