Login / Signup
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs.
David Coudert
Guillaume Ducoffe
Alexandru Popa
Published in:
CoRR (2017)
Keyphrases
</>
computationally efficient
computational complexity
graph theory
significant improvement
computational cost
theoretical analysis
combinatorial optimization
maximum clique
bayesian networks
data structure
special case
worst case
graph data
maximal cliques
computationally hard
maximal clique enumeration