11 citations · 15 across the 2 of their papers we have counts for
3 papers
cs.DS2012★ 11 cited
Distributing an Exact Algorithm for Maximum Clique: maximising the costup
Ciaran McCreesh, Patrick Prosser
We take an existing implementation of an algorithm for the maximum clique problem and modify it so that we can distribute it over an ad-hoc cluster of machines. Our goal was to ach…
cs.DM2012★ 4 cited
Diamond-free Degree Sequences
Alice Miller, Patrick Prosser
We introduce a new problem, CSPLib problem number 50, to generate all degree sequences that have a corresponding diamond-free graph with secondary properties. This problem arises n…
cs.DS2012
Exact Algorithms for Maximum Clique: a computational study
Patrick Prosser
We investigate a number of recently reported exact algorithms for the maximum clique problem (MCQ, MCR, MCS, BBMC). The program code used is presented and critiqued showing how sma…