ESCAPE: Efficiently Counting All 5-Vertex Subgraphs

@inproceedings{Pinar2017ESCAPEEC,
  title={ESCAPE: Efficiently Counting All 5-Vertex Subgraphs},
  author={Ali Pinar and Seshadhri Comandur and Vaidyanathan Vishal},
  booktitle={WWW},
  year={2017}
}
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 case of triangle counting has received much attention. Getting results for 4-vertex or 5-vertex patterns is highly challenging, and there are few practical results known that can scale to massive sizes. We introduce an algorithmic framework that can be adopted to count any small pattern in a graph and apply this… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 3 times over the past 90 days. VIEW TWEETS