Geometric Deep Learning Graph Pruning to Speed-Up the Run-Time of Maximum Clique Enumerarion Algorithms
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 …
Conference
Andrea Arciprete, Vincenza Carchiolo, Daniela Chiavetta, Marco Grassia et al.
•
•
1 min read