Ciaran McCreesh
TitoloCitata daAnno
Multi-threading a state-of-the-art maximum clique algorithm
C McCreesh, P Prosser
Algorithms 6 (4), 618-635, 2013
432013
The shape of the search tree for the maximum clique problem and the implications for parallel branch and bound
C McCreesh, P Prosser
ACM Transactions on Parallel Computing 2 (1), 8, 2015
322015
Portfolios of subgraph isomorphism algorithms
L Kotthoff, C McCreesh, C Solnon
International Conference on Learning and Intelligent Optimization, 107-122, 2016
212016
A parallel, backjumping subgraph isomorphism algorithm using supplemental graphs
C McCreesh, P Prosser
International conference on principles and practice of constraint …, 2015
212015
Clique and constraint models for maximum common (connected) subgraph problems
C McCreesh, SN Ndiaye, P Prosser, C Solnon
International Conference on Principles and Practice of Constraint …, 2016
192016
Replicable parallel branch and bound search
B Archibald, P Maier, C McCreesh, R Stewart, P Trinder
Journal of Parallel and Distributed Computing 113, 92-114, 2018
122018
Reducing the branching in a branch and bound algorithm for the maximum clique problem
C McCreesh, P Prosser
International Conference on Principles and Practice of Constraint …, 2014
102014
Solving hard subgraph problems in parallel
C McCreesh
University of Glasgow, 2017
92017
Between subgraph isomorphism and maximum common subgraph
R Hoffmann, C McCreesh, C Reilly
Thirty-First AAAI Conference on Artificial Intelligence, 2017
82017
A partitioning algorithm for maximum common subgraph problems
C McCreesh, P Prosser, J Trimble
82017
A parallel branch and bound algorithm for the maximum labelled clique problem
C McCreesh, P Prosser
Optimization Letters 9 (5), 949-960, 2015
82015
An exact branch and bound algorithm with symmetry breaking for the maximum balanced induced biclique problem
C McCreesh, P Prosser
International Conference on AI and OR Techniques in Constriant Programming …, 2014
82014
On maximum weight clique algorithms, and how they are evaluated
C McCreesh, P Prosser, K Simpson, J Trimble
International Conference on Principles and Practice of Constraint …, 2017
72017
Heuristics and Really Hard Instances for Subgraph Isomorphism Problems.
C McCreesh, P Prosser, J Trimble
IJCAI, 631-638, 2016
72016
Case Studies and Challenges in Reproducibility in the Computational Sciences
S Arabas, MR Bareford, LR de Silva, IP Gent, BM Gorman, ...
arXiv preprint arXiv:1408.2123, 2014
72014
When subgraph isomorphism is really hard, and why this matters for graph databases
C McCreesh, P Prosser, C Solnon, J Trimble
Journal of Artificial Intelligence Research 61, 723-759, 2018
62018
Task variant allocation in distributed robotics
J Cano, DR White, A Bordallo, C McCreesh, P Prosser, J Singer, ...
Robotics Science and Systems 2016, 2016
62016
Distributing an Exact Algorithm for Maximum Clique: maximising the costup
C McCreesh, P Prosser
arXiv preprint arXiv:1209.4560, 2012
42012
Observations from parallelising three maximum common (connected) subgraph algorithms
R Hoffmann, C McCreesh, SN Ndiaye, P Prosser, C Reilly, C Solnon, ...
International Conference on the Integration of Constraint Programming …, 2018
32018
A review of literature on parallel constraint solving
IP Gent, I Miguel, P Nightingale, C McCreesh, P Prosser, NCA Moore, ...
Theory and Practice of Logic Programming 18 (5-6), 725-758, 2018
22018
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20