Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem

Authors:
Satoshi Taoka;Daisuke Takafuji;Toshimasa Watanabe
Affiliations:
-;-;-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2008

Citing 6
Cited 0

A generalized implicit enumeration algorithm for graph coloring

Communications of the ACM - Lecture notes in computer science Vol. 174
Using tabu search techniques for graph coloring

Computing
Parallel programming with MPI

Parallel programming with MPI
The Complexity of Near-Optimal Graph Coloring

Journal of the ACM (JACM)
New methods to color the vertices of a graph

Communications of the ACM
A new algorithm for the maximum-weight clique problem

Nordic Journal of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A branch-and-bound algorithm (BB for short) is the most general technique to deal with various combinatorial optimization problems. Even if it is used, computation time is likely to increase exponentially. So we consider its parallelization to reduce it. It has been reported that the computation time of a parallel BB heavily depends upon node-variable selection strategies. And, in case of a parallel BB, it is also necessary to prevent increase in communication time. So, it is important to pay attention to how many and what kind of nodes are to be transferred (called sending-node selection strategy). In this paper, for the graph coloring problem, we propose some sending-node selection strategies for a parallel BB algorithm by adopting MPI for parallelization and experimentally evaluate how these strategies affect computation time of a parallel BB on a PC cluster network.