A local core number based algorithm for the maximum clique problem

DOI10.22108/TOC.2021.120153.1686MaRDI QIDQ4958092zbMATH OpenOpenAlexFDO

Authors Neda Mohammadi, Mehdi Kadivar

Publication date 6 September 2021

Full work available at URL https://doaj.org/article/907341ad700e48ad88b988d8850e5384

zbMATH Keywords

branch and boundcore numbermaximum clique

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• An improved branch and bound algorithm for the maximum clique problem
• A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
• A fast algorithm for the maximum clique problem
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
• A simple and faster branch-and-bound algorithm for finding a maximum clique

Cited in

(3)

• Local search for diversified top-\(k\) clique search problem
• scientific article; zbMATH DE number 5547826 (Why is no real title available?)
• An exact algorithm for the maximum probabilistic clique problem

Describes a project that uses

Uses Software

• MaxCliqueDyn
• BBMCSP
• BBMCL

This page was built for publication: A local core number based 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 Q4958092)