55 citations · 116 across the 11 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.SI2017
Provable and practical approximations for the degree distribution using sublinear graph samples
Talya Eden, Shweta Jain, Ali Pinar +2
The degree distribution is one of the most fundamental properties used in the analysis of massive graphs. There is a large literature on graph sampling, where the goal is to estima…
cs.SI2017★ 55 cited
Local Algorithms for Hierarchical Dense Subgraph Discovery
Ahmet Erdem Sariyuce, C. Seshadhri, Ali Pinar
Finding the dense regions of a graph and relations among them is a fundamental problem in network analysis. Core and truss decompositions reveal dense subgraphs with hierarchical r…