A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers.
Doruk BozdagÜmit V. ÇatalyürekAssefaw Hadish GebremedhinFredrik ManneErik G. BomanFüsun ÖzgünerPublished in: HPCC (2005)
Keyphrases
- distributed memory
- parallel implementation
- graph coloring
- multiprocessor systems
- dynamic programming
- ibm sp
- search space
- shared memory
- parallel architecture
- optimization algorithm
- combinatorial problems
- combinatorial optimization
- cost function
- optimal solution
- parallel computers
- benchmark problems
- distributed breakout
- randomly generated
- similarity measure
- parallel processing
- simulated annealing
- np hard
- objective function