Efficiency and precision trade-offs in graph summary algorithms.

Stéphane Campinas Renaud Delbru Giovanni Tummarello

Published in: IDEAS (2013)

Keyphrases

trade off
computational complexity
graph theory
learning algorithm
computational efficiency
data mining
association rules
significant improvement
partitioning algorithm
benchmark datasets
orders of magnitude
maximum clique
maximum flow
highly efficient
random walk
worst case
computational cost
social networks