Login / Signup
Geometric Deep Learning Graph Pruning to Speed-Up the Run-Time of Maximum Clique Enumerarion Algorithms.
A. Arciprete
Vincenza Carchiolo
D. Chiavetta
Marco Grassia
Michele Malgeri
Giuseppe Mangioni
Published in:
COMPLEX NETWORKS (1) (2022)
Keyphrases
</>
maximum clique
deep learning
graph theory
branch and bound algorithm
maximal cliques
learning algorithm
association graph
machine learning
maximal clique enumeration
computational biology
data mining
information retrieval
objective function
complex networks
combinatorial optimization