About parallelization of an algorithm for the maximum clique problem

MaRDI QIDQ5219841zbMATH OpenFDO

Authors Venelin Monev, Maria Dzhumalieva-Stoeva, Iliya G. Bouyukliev

Publication date 12 March 2020

Full work available at URL http://www.moi.math.bas.bg/oc2013/a8.pdf

Mathematics Subject Classification ID

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

Recommendations

• A parallel implementation for the maximum clique problem
• scientific article; zbMATH DE number 1424217
• Multi-threading a state-of-the-art maximum clique algorithm
• scientific article; zbMATH DE number 1786225
• Parallelization of a branch-and-bound algorithm for the maximum weight clique problem

Cited in

(7)

• Multi-threading a state-of-the-art maximum clique algorithm
• scientific article; zbMATH DE number 1728440 (Why is no real title available?)
• scientific article; zbMATH DE number 5669599 (Why is no real title available?)
• Parallelizations of the Error Correcting Code Problem
• Parallel Algorithm for Enumerating Maximal Cliques in Complex Network
• scientific article; zbMATH DE number 1424217 (Why is no real title available?)
• A parallel implementation for the maximum clique problem

This page was built for publication: About parallelization of an algorithm for the maximum clique problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5219841)