19 citations · 56 across the 10 of their papers we have counts for
4 papers · 1 filter
Case Studies and Challenges in Reproducibility in the Computational Sciences
Sylwester Arabas, Michael R. Bareford, Lakshitha R. de Silva +14
This paper investigates the reproducibility of computational science research and identifies key challenges facing the community today. It is the result of the First Summer School…
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 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…