47 citations · 65 across the 2 of their papers we have counts for
2 papers
cs.DS2014★ 18 cited
Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts
Madhav Jha, C. Seshadhri, Ali Pinar
Counting the frequency of small subgraphs is a fundamental technique in network analysis across various domains, most notably in bioinformatics and social networks. The special cas…
physics.soc-ph2014★ 47 cited
Accelerating Community Detection by Using K-core Subgraphs
Chengbin Peng, Tamara G. Kolda, Ali Pinar
Community detection is expensive, and the cost generally depends at least linearly on the number of vertices in the graph. We propose working with a reduced graph that has many few…