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

David Coudert Guillaume Ducoffe Alexandru Popa

Published in: ACM Trans. Algorithms (2019)

Keyphrases

graph theory
significant improvement
computational complexity
optimization problems
learning algorithm
computational cost
theoretical analysis
maximum weight
bayesian networks
optimal solution
computationally efficient
minimum spanning tree
maximum clique
maximal clique enumeration