Analyzing the Fault-Containment Time of Self-Stabilizing Algorithms - A Case Study for Graph Coloring.
Volker TurauPublished in: CoRR (2014)
Keyphrases
- graph coloring
- optimization problems
- learning algorithm
- combinatorial problems
- np complete problems
- constraint satisfaction problems
- heuristic methods
- search methods
- phase transition
- distributed breakout
- neural network
- distributed constraint optimization problems
- orders of magnitude
- linear programming
- multi objective
- artificial neural networks
- computational complexity