An Incremental Distributed Algorithm for a Partial Grundy Coloring of Graphs.
Lyes DekarBrice EffantinHamamache KheddouciPublished in: ISPA (2007)
Keyphrases
- detection algorithm
- single pass
- preprocessing
- k means
- times faster
- cost function
- optimization algorithm
- learning algorithm
- incremental version
- search space
- computational cost
- distributed systems
- segmentation algorithm
- simulated annealing
- experimental evaluation
- dynamic programming
- objective function
- high accuracy
- particle swarm optimization
- worst case
- matching algorithm
- np hard
- incremental learning
- graph structure
- weighted graph
- spanning tree
- computational complexity
- minimum spanning tree