A Fast Exact Algorithm to Enumerate Maximal Pseudo-cliques in Large Sparse Graphs.

Ahsanur Rahman Kalyan Roy Ramiza Maliha Townim Faisal Chowdhury

Published in: KDD (2024)

Keyphrases

detection algorithm
dynamic programming
bayesian networks
objective function
k means
np hard
learning algorithm
cost function
adjacency graph
simulated annealing
fully connected
minimum spanning tree
directed acyclic
hyper graph
brute force
optimization algorithm
worst case
computational cost
search space