TAGs: scalable threshold-based algorithms for proximity computation in graphs.

Apostolos Lyritsis Apostolos N. Papadopoulos Yannis Manolopoulos

Published in: EDBT (2011)

Keyphrases

computational complexity
highly scalable
computational cost
graph theory
highly efficient
data structure
theoretical analysis
lower bound
worst case
lightweight