Evaluation of Serial and Parallel Shared-Memory Distance-1 Graph Coloring Algorithms.
Lukas GnamSiegfried SelberherrJosef WeinbubPublished in: NMA (2018)
Keyphrases
- shared memory
- parallel architectures
- graph coloring
- parallel computers
- distributed memory
- parallel algorithm
- message passing
- parallel computing
- parallel execution
- combinatorial problems
- distributed breakout
- multi processor
- parallel implementation
- parallel programming
- low overhead
- optimization problems
- single processor
- parallel processing
- orders of magnitude
- parallel machines
- depth first search
- computational complexity
- combinatorial optimization problems
- constraint satisfaction problems
- evolutionary algorithm