Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning

Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis. Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. In Ravi Kumar, D. Sivakumar, editors, Algorithms and Models for the Web-Graph - 7th International Workshop, WAW 2010, Stanford, CA, USA, December 13-14, 2010. Proceedings. Volume 6516 of Lecture Notes in Computer Science, pages 15-24, Springer, 2010. [doi]

Abstract

Abstract is missing.