An expected polynomial time algorithm for coloring 2-colorable 3-graphs.

Yury Person Mathias Schacht

Published in: Electron. Notes Discret. Math. (2009)

Keyphrases

dynamic programming
preprocessing
cost function
computational complexity
k means
learning algorithm
detection algorithm
optimization algorithm

expectation maximization
particle swarm optimization
search space
optimal solution
significant improvement
experimental evaluation
undirected graph
high accuracy

genetic algorithm
similarity measure
graph model
matching algorithm
convergence rate
recognition algorithm
approximation ratio

graph construction
subgraph isomorphism
clustering method
worst case
probabilistic model
np hard
objective function