FPT Algorithms for Finding Near-Cliques in c-Closed Graphs.

Balaram Behera Edin Husic Shweta Jain Tim Roughgarden C. Seshadhri

Published in: ITCS (2022)

Keyphrases

maximum clique
maximal cliques
learning algorithm
computational cost
graph theory
computationally efficient
graph structure
weighted graph
queueing networks
data structure
computational complexity
theoretical analysis