A review on algorithms for maximum clique problems

By Qinghua Wu, Jin-Kao Hao. European Journal of Operational Research, 2015

321 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/c6ceb0ef34dec541afb9f9e205bd023644b4be76

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Francesco Rinaldi
2. Damiano Zeffiro
3. Luca Carlone
4. Immanuel M. Bomze

In Computational Theory and Mathematics

1. Heng Yang
2. Francesco Rinaldi
3. Damiano Zeffiro
4. Luca Carlone
5. Jingnan Shi

In Computer Networks and Communications

1. Luca Carlone

Citations in the corpus

• TEASER: Fast and Certifiable Point Cloud Registration (2020, background): “Although finding the maximal cliques of a graph takes exponential time in general, there exist efficient approximation algorithms that scale to graphs with millions of nodes [103]–[105].”
• Fast Cluster Detection in Networks by First Order Optimization (2021, background): “The problem of finding maximal cliques has numerous applications in domains including telecommunication networks, biochemistry, financial networks, and scheduling ([7], [30]).”