On the Complexity of Distributed Greedy Coloring.
Cyril GavoilleRalf KlasingAdrian KosowskiAlfredo NavarraPublished in: DISC (2007)
Keyphrases
- distributed systems
- search algorithm
- fault tolerant
- real world
- peer to peer
- space complexity
- worst case
- decision problems
- greedy algorithm
- multi agent
- cooperative
- computing environments
- dynamic programming
- communication cost
- simulated annealing
- distributed data
- distributed architecture
- distributed learning
- distributed environment
- lightweight
- data sets
- evolutionary algorithm
- digital libraries
- bayesian networks
- artificial intelligence
- information retrieval
- neural network