Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
1401.5921
Cited By
v1
v2
v3 (latest)
The Shape of the Search Tree for the Maximum Clique Problem, and the Implications for Parallel Branch and Bound
ACM Transactions on Parallel Computing (TOPC), 2014
23 January 2014
Ciaran McCreesh
P. Prosser
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"The Shape of the Search Tree for the Maximum Clique Problem, and the Implications for Parallel Branch and Bound"
6 / 6 papers shown
A Review of Literature on Parallel Constraint Solving
Ian P. Gent
Ciaran McCreesh
Ian Miguel
Neil C. A. Moore
Peter William Nightingale
P. Prosser
Chris Unsworth
210
20
0
29 Mar 2018
mts: A light framework for parallelizing tree search codes
D. Avis
Charles Jordan
50
7
0
22 Sep 2017
An analysis of budgeted parallel search on conditional Galton-Watson trees
D. Avis
Luc Devroye
44
5
0
31 Mar 2017
Replicable Parallel Branch and Bound Search
B. Archibald
Patrick Maier
Ciaran McCreesh
Robert J. Stewart
P. Trinder
LRM
75
23
0
16 Mar 2017
mplrs: A scalable parallel vertex/facet enumeration code
D. Avis
Charles Jordan
83
32
0
20 Nov 2015
A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem
Optimization Letters (Optim. Lett.), 2014
Ciaran McCreesh
P. Prosser
136
8
0
25 Jul 2014
1
Page 1 of 1
