Multi-threading a state-of-the-art maximum clique algorithm

DOI10.3390/a6040618zbMath1461.05215OpenAlexW2003010406MaRDI QIDQ1736587

Patrick Prosser, Ciaran McCreesh

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a6040618

zbMATH Keywords

parallel algorithmsmaximum cliquemulti-coreparallel branch and bound

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

Parallel Maximum Clique Algorithms with Applications to Network Analysis ⋮ A review on algorithms for maximum clique problems ⋮ Solving the maximum vertex weight clique problem via binary quadratic programming ⋮ On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem ⋮ A new exact maximum clique algorithm for large and massive sparse graphs ⋮ An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network ⋮ A parallel maximum clique algorithm for large and massive sparse graphs ⋮ Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection ⋮ A parallel branch and bound algorithm for the maximum labelled clique problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact bit-parallel algorithm for the maximum clique problem
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
• Exact algorithms for maximum clique: a computational study
• An improved bit parallel exact maximum clique algorithm
• Improvements to MCS algorithm for the maximum clique problem
• Clique-detection models in computational biochemistry and genomics
• Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
• A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
• Anomalies in parallel branch-and-bound algorithms
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis

This page was built for publication: Multi-threading a state-of-the-art maximum clique algorithm