Greedy graph colouring is a misleading heuristic
C McCreesh, P Prosser - arXiv preprint arXiv:1310.7741, 2013 - arxiv.org
arXiv preprint arXiv:1310.7741, 2013•arxiv.org
… In this case, the maximum clique number, colour number, and greedy colouring number all
agree; usually we are not so fortunate. … Unfortunately a greedy colouring is misleading:
sometimes, it can colour a graph G with k colours, but then require k + 1 (for arbitrarily large
values of 1) colours to colour an induced subgraph of G. We give one example in Figure 2.
There are two implications. … Figure 2: Greedy colouring is a misleading heuristic. On the left, a …
agree; usually we are not so fortunate. … Unfortunately a greedy colouring is misleading:
sometimes, it can colour a graph G with k colours, but then require k + 1 (for arbitrarily large
values of 1) colours to colour an induced subgraph of G. We give one example in Figure 2.
There are two implications. … Figure 2: Greedy colouring is a misleading heuristic. On the left, a …
State of the art maximum clique algorithms use a greedy graph colouring as a bound. We show that greedy graph colouring can be misleading, which has implications for parallel branch and bound.
arxiv.org
Showing the best result for this search. See all results