45 citations · 105 across the 14 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.SI2015
Distributed Estimation of Graph 4-Profiles
Ethan R. Elenberg, Karthikeyan Shanmugam, Michael Borokhovich +1
We present a novel distributed algorithm for counting all four-node induced subgraphs in a big graph. These counts, called the -profile, describe a graph's connectivity properti…
cs.SI2015★ 7 cited
Beyond Triangles: A Distributed Framework for Estimating 3-profiles of Large Graphs
Ethan R. Elenberg, Karthikeyan Shanmugam, Michael Borokhovich +1
We study the problem of approximating the -profile of a large graph. -profiles are generalizations of triangle counts that specify the number of times a small graph appears a…