A Distributed Algorithm for a b-Coloring of a Graph.
Brice EffantinHamamache KheddouciPublished in: ISPA (2006)
Keyphrases
- dynamic programming
- learning algorithm
- preprocessing
- optimization algorithm
- k means
- cost function
- high accuracy
- computational cost
- experimental evaluation
- recognition algorithm
- shortest path problem
- search space
- optimal solution
- graph based algorithm
- graph structure
- simulated annealing
- breadth first search
- distributed environment
- dominating set
- directed graph
- clustering method
- detection algorithm
- finding the shortest path
- expectation maximization
- worst case
- np hard
- significant improvement
- similarity measure
- segmentation algorithm
- random walk
- multi objective
- spanning tree
- minimum spanning tree
- random graphs
- search algorithm
- multi agent
- decision trees