A parallel branch and bound algorithm for the maximum labelled clique problem
Open Access
- 10 December 2014
- journal article
- Published by Springer Nature in Optimization Letters
- Vol. 9 (5) , 949-960
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Initial Sorting of Vertices in the Maximum Clique Problem Reviewed2014
- Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique ProblemLecture Notes in Computer Science, 2014
- A Mathematical Programming Approach for the Maximum Labeled Clique ProblemProcedia - Social and Behavioral Sciences, 2014
- Multi-Threading a State-of-the-Art Maximum Clique AlgorithmAlgorithms, 2013
- Exact Parallel Maximum Clique Algorithm for General and Protein GraphsJournal of Chemical Information and Modeling, 2013
- Exact Algorithms for Maximum Clique: A Computational Study Algorithms, 2012
- An improved bit parallel exact maximum clique algorithmOptimization Letters, 2011
- An exact bit-parallel algorithm for the maximum clique problemComputers & Operations Research, 2011
- An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational ExperimentsJournal of Global Optimization, 2006
- Anomalies in parallel branch-and-bound algorithmsCommunications of the ACM, 1984