11 citations · 25 across the 10 of their papers we have counts for
Showing 2014 · cs.DSShow all
3 papers · 2 filters
cs.DS2014
Empirical Algorithmics: draw your own conclusions
Frod Prefect, Patrick Prosser
In an empirical comparisons of algorithms we might compare run times over a set of benchmark problems to decide which one is fastest, i.e. an algorithmic horse race. Ideally we wou…
cs.DS2014
Finding Maximum k-Cliques Faster using Lazy Global Domination
Ciaran McCreesh, Patrick Prosser
A clique in a graph is a set of vertices, each of which is adjacent to every other vertex in this set. A k-clique relaxes this requirement, requiring vertices to be within a distan…
cs.DS2014
A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem
Ciaran McCreesh, Patrick Prosser
The maximum labelled clique problem is a variant of the maximum clique problem where edges in the graph are given labels, and we are not allowed to use more than a certain number o…