Algorithms for finding clique-transversals of graphs.

Guillermo Durán Min Chih Lin Sergio Mera Jayme Luiz Szwarcfiter

Published in: Ann. Oper. Res. (2008)

Keyphrases

maximum clique
orders of magnitude
graph theory
learning algorithm
optimization problems
theoretical analysis
graph matching
computational cost
computationally efficient
data sets
bayesian networks
data streams
computational complexity
graph search
graph isomorphism