A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms

13 March 2024

Papers citing "A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms"

4 / 4 papers shown

Title
Finding planted cliques using Markov chain Monte Carlo Reza Gheissari Aukosh Jagannath Yiming Xu 21 3 0 13 Nov 2023
Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems like Max-Cut S. Boettcher GNN 18 22 0 02 Oct 2022
Nonequilibrium Monte Carlo for unfreezing variables in hard combinatorial optimization Masoud Mohseni D. Eppens J. Strümpfer Raffaele Marino Vasil S. Denchev A. Ho Sergei V. Isakov Sergio Boixo F. Ricci-Tersenghi Hartmut Neven 13 20 0 26 Nov 2021
A Survey on The Expressive Power of Graph Neural Networks Ryoma Sato 167 170 0 09 Mar 2020