Speeding up MCS algorithm for the maximum clique problem with ILS heuristic and other enhancements
DOI10.1007/978-1-4614-8588-9_7zbMATH Open1344.90063OpenAlexW15861619MaRDI QIDQ2820111FDOQ2820111
Authors: Evgeny Maslov, Mikhail Batsyn, Panos M. Pardalos 
Publication date: 13 September 2016
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-8588-9_7
Recommendations
- Improvements to MCS algorithm for the maximum clique problem
- Speeding up branch and bound algorithms for solving the maximum clique problem
- A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- Exact algorithms for maximum clique: a computational study
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Algorithm 457: finding all cliques of an undirected graph
- Title not available (Why is that?)
- A hybrid heuristic for the maximum clique problem
- Greedy randomized adaptive search procedures
- Large Cliques Elude the Metropolis Process
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- Fast local search for the maximum independent set problem
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: Speeding up MCS algorithm for the maximum clique problem with ILS heuristic and other enhancements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820111)
