34 research outputs found
Greedy Graph Colouring is a Misleading Heuristic
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
Multi-threading a state-of-the-art maximum clique algorithm
We present a threaded parallel adaptation of a state-of-the-art maximum clique
algorithm for dense, computationally challenging graphs. We show that near-linear speedups
are achievable in practice and that superlinear speedups are common. We include results for
several previously unsolved benchmark problems