Maximum Clique

Geometric deep learning sub-network extraction for maximum clique enumeration

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 network, we employ geometric deep learning to extract a sub-network on …