Practical algorithms for triangle computations in very large ( sparse ( power-law ) ) graphs

@inproceedings{Latapy2007PracticalAF,
  title={Practical algorithms for triangle computations in very large ( sparse ( power-law ) ) graphs},
  author={Matthieu Latapy},
  year={2007}
}
Finding, counting and/or listing triangles in large graphs are natural problems, which received recently much attention because of their importance in complex network analysis. However, the time and/or space requirements of known algorithms limit our ability to solve these problems in practice. We give here a quick overview of previous results, with a special emphasis on space requirements, which were not considered before. We then detail the analysis a recently proposed algorithm which… CONTINUE READING