Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Ciaran McCreesh, Patrick Prosser. A parallel branch and bound algorithm for the maximum labelled clique problem. Optimization Letters, 9(5):949-960, 2015. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique ProblemCiaran McCreesh, Patrick Prosser. cp 2014: 549-563 [doi] The Shape of the Search Tree for the Maximum Clique Problem and the Implications for Parallel Branch and BoundCiaran McCreesh, Patrick Prosser. topc, 2(1):8, 2015. [doi]
The following publications are possibly variants of this publication: