11 citations · 25 across the 10 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
The Ultrametric Constraint and its Application to Phylogenetics
Neil C. A. Moore, Patrick Prosser
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylo…
The Shape of the Search Tree for the Maximum Clique Problem, and the Implications for Parallel Branch and Bound
Ciaran McCreesh, Patrick Prosser
Finding a maximum clique in a given graph is one of the fundamental NP-hard problems. We compare two multi-core thread-parallel adaptations of a state-of-the-art branch and bound a…