activity
20092025
most citedA Novel Approach to Finding Near-Cliques: The Triangle-Densest Subgraph Problem

18 citations · 169 across the 45 of their papers we have counts for

collaborators
Showing 2009Show all

2 papers · 1 filter

cs.DS2009★ 18 cited

MACH: Fast Randomized Tensor Decompositions

Charalampos E. Tsourakakis

Tensors naturally model many real world processes which generate multi-aspect data. Such processes appear in many different research disciplines, e.g, chemometrics, computer vision…

cs.DS2009★ 17 cited

Approximate Triangle Counting

Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller

Triangle counting is an important problem in graph mining. Clustering coefficients of vertices and the transitivity ratio of the graph are two metrics often used in complex network…