151 citations · 264 across the 42 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DS2010★ 15 cited
Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning
Mihail N. Kolountzakis, Gary L. Miller, Richard Peng +1
The number of triangles is a computationally expensive graph statistic which is frequently used in complex network analysis (e.g., transitivity ratio), in various random graph mode…
math.MG2010★ 5 cited
Tilings by translation
Mihail N. Kolountzakis, Mate Matolcsi
This is a survey about tiling by translation only and related questions and methods, especially those that have to do with Fourier Analysis.