• DOI:10.1109/ACSSC.2015.7421397
Corpus ID: 34922925

Counting triangles in real-world graph streams: Dealing with repeated edges and time windows

@article{Jha2015CountingTI,
  title={Counting triangles in real-world graph streams: Dealing with repeated edges and time windows},
  author={M. Jha and Ali Pinar and Seshadhri Comandur},
  journal={2015 49th Asilomar Conference on Signals, Systems and Computers},
  year={2015},
  pages={1507-1514}
}

M. Jha, Ali Pinar, Seshadhri Comandur

Published 2015

Computer Science, Mathematics

2015 49th Asilomar Conference on Signals, Systems and Computers

Graphs in the real-world are often temporal and can be represented as a "stream" of edges. Estimating the number of triangles in a graph observed as a stream of edges is a fundamental problem in data mining. Our goal is to design a single pass space-efficient streaming algorithm for estimating triangle counts. While there are numerous algorithms for this problem, they all (implicitly or explicitly) assume that the stream does not contain duplicate edges. However, real graph streams are rife… CONTINUE READING

View on IEEE

arxiv.org

Save to Library

Create Alert

Cite

Launch Research Feed