Maximum clique via \textsc{MaxSat} and back again
From MaRDI portal
Publication:6489458
DOI10.21711/231766362015/RMC4418MaRDI QIDQ6489458FDOQ6489458
Authors: Alexandre Prusch Züge, Renato Carmo 
Publication date: 22 April 2024
Published in: Matemática Contemporânea (Search for Journal in Brave)
Recommendations
- Speeding up branch and bound algorithms for solving the maximum clique problem
- Infra-chromatic bound for exact maximum clique search
- Incremental Upper Bound for the Maximum Clique Problem
- Solving maximum weight clique using maximum satisfiability reasoning
- An exact algorithm based on MaxSAT reasoning for the maximum weight clique problem
This page was built for publication: Maximum clique via \textsc{MaxSat} and back again
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489458)
