An expected polynomial time algorithm for coloring 2-colorable 3-graphs.
Yury PersonMathias SchachtPublished in: Discret. Math. Theor. Comput. Sci. (2011)
Keyphrases
- computational complexity
- optimization algorithm
- polynomial time complexity
- dynamic programming
- worst case
- segmentation algorithm
- graph isomorphism
- preprocessing
- matching algorithm
- detection algorithm
- np complete
- learning algorithm
- planar graphs
- convergence rate
- experimental evaluation
- special case
- optimal solution
- particle swarm optimization
- expectation maximization
- simulated annealing
- high accuracy
- computational cost
- clustering method
- tree structure
- significant improvement
- randomized algorithm
- decision trees
- neural network