Ciaran Mccreesh

Mr. Ciaran Mccreesh


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 October 2013 in Algorithms
Verified
Journal Article
Open access
PDF file
CMCiaran Mccreesh
Ciaran Mccreesh
PPPatrick Prosser
Patrick Prosser
We present a threaded parallel adaptation of a state-of-the-art maximum clique algorithm for dense, computationally challenging graphs. We show that near-linear speedups are achievable in practice and that superlinear speedups are common. We include results for several previously unsolved benchmark problems.


1 December 2016
Verified
Book Chapter
Closed access
PDF file
LKLars Kotthoff
Lars Kotthoff
CMCiaran Mccreesh
Ciaran Mccreesh
CSChristine Solnon
Christine Solnon

23 August 2016
Verified
Book Chapter
Closed access
PDF file
CMCiaran Mccreesh
Ciaran Mccreesh
SNSamba Ndojh Ndiaye
Samba Ndojh Ndiaye
PPPatrick Prosser
Patrick Prosser
CSChristine Solnon
Christine Solnon

10 December 2014 in Optimization Letters
Verified
Journal Article
Open access
PDF file
CMCiaran Mccreesh
Ciaran Mccreesh
PPPatrick Prosser
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 of distinct labels in a solution. We introduce a new branch-and-bound algorithm for the problem, and explain how it may be parallelised. We evaluate an implementation on a set of benchmark instances, and show that it is consistently faster than previously published results, sometimes by four or five orders of magnitude.

27 August 2014 in arXiv
Verified
Preprint
Open access
PDF file
CMCiaran Mccreesh
Ciaran Mccreesh
PPPatrick Prosser
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 distance k of each other, rather than directly adjacent. In theory, a maximum clique algorithm can easily be adapted to solve the maximum k-clique problem. We use a state of the art maximum clique algorithm to show that this is feasible in practice, and introduce a lazy global domination rule which sometimes vastly reduces the search space. We include experimental results for a range of real-world and benchmark graphs, and a detailed look at random graphs.