Given a graph G and positive integers B and W, the BWC problem asks about the existence of a coloring of G, with B black and W white vertices, such that there is no edge between a black and a white vertex.We suggest a heuristic, based on tabu search, which yields quite good results for this problem. We compare the performance of our algorithm to that of several other known heuristics, and also to what one might expect based on some theoretical results we obtained for the checked graphs.
- BWC problem
- Tabu search
ASJC Scopus subject areas
- Computer Science Applications
- Management Science and Operations Research
- Control and Optimization
- Applied Mathematics