In this paper we propose a method based on geometric deep learning to reduce the computational complexity of the Maximum Clique Enumeration (MCE) problem. Specifically, given a …
Combinatorial optimization problems arise naturally in a wide range of applications from diverse domains. Many of these problems are NP-hard and designing efficient heuristics for …
In this paper we propose a method to reduce the running time to solve the Maximum Clique Enumeration (MCE) problem. Specifically, given a network we employ geometric deep learning …
We propose a multi-stage learning approach for pruning the search space of maximum clique enumeration, a fundamental computationally difficult problem arising in various network …