An experimental analysis of exact algorithms for the maximum clique problem

DOI10.21711/231766362015/RMC4417MaRDI QIDQ6489457zbMATH OpenFDO

Authors Cleverson Sebastião dos Anjos, Alexandre Prusch Züge, Renato Carmo

Publication date 22 April 2024

Published in Matemática Contemporânea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21711/231766362015/RMC4417

zbMATH Keywords

algorithmsbranch and boundmaximum clique

Recommendations

• On comparing algorithms for the maximum clique problem
• Exact algorithms for maximum clique: a computational study
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
• An exact algorithm for the maximum clique problem
• Lexicographic breadth first-search and branch and bound algorithms for the maximum clique problem

Cited in

(1)

• Lexicographic breadth first-search and branch and bound algorithms for the maximum clique problem

This page was built for publication: An experimental analysis of exact algorithms for the maximum clique problem

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