Graph coloring on coarse grained multicomputers.
Assefaw Hadish GebremedhinIsabelle Guérin LassousJens GustedtJan Arne TellePublished in: Discret. Appl. Math. (2003)
Keyphrases
- graph coloring
- coarse grained
- fine grained
- combinatorial problems
- job shop scheduling
- constraint satisfaction problems
- phase transition
- scheduling problem
- max sat
- high level
- protein sequences
- shared memory
- traveling salesman problem
- access control
- bin packing
- hyper heuristics
- satisfiability problem
- search procedure
- combinatorial optimization problems
- constraint programming
- upper bound
- computational complexity