47 citations · 89 across the 4 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2016★ 21 cited
ESCAPE: Efficiently Counting All 5-Vertex Subgraphs
Ali Pinar, C. Seshadhri, V. Vishal
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…
cs.SI2016★ 3 cited
Fast Hierarchy Construction for Dense Subgraphs
A. Erdem Sariyuce, Ali Pinar
Discovering dense subgraphs and understanding the relations among them is a fundamental problem in graph mining. We want to not only identify dense subgraphs, but also build a hier…