Faster sublinear approximations of k-cliques for low arboricity graphs.

Talya Eden Dana Ron C. Seshadhri

Published in: CoRR (2018)

Keyphrases

weighted graph
maximal cliques
graph structure
maximum clique
graph matching
graph theory
high levels
genetic algorithm
pairwise
random variables
data sets
graph theoretic
pruning power
graph structures
efficient computation
graph partitioning
undirected graph