11 citations · 25 across the 10 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013★ 1 cited
Greedy Graph Colouring is a Misleading Heuristic
Ciaran McCreesh, Patrick Prosser
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 branc…
cs.DS2013
An n-ary Constraint for the Stable Marriage Problem
Chris Unsworth, Patrick Prosser
We present an n-ary constraint for the stable marriage problem. This constraint acts between two sets of integer variables where the domains of those variables represent preference…