Finding, counting and listing all triangles in large graphs, an experimental study

Lecture Notes in Computer Science

Volumn 3503, Issue , 2005, Pages 606-609

  Schank, Thomas ^a   Wagner, Dorothea ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

LARGE GRAPHS;

EID: 24944510331     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11427186_54     Document Type: Conference Paper

References (4)

1. AYZ97. Noga Alon, Raphael Yuster, and Uri Zwick. Finding and counting given length cycles. Algorithmica, 17(3):209-223, 1997.
2. BM01. Vladimir Batagelj and Andrej Mrvar. A subquadratic triad census algorithm for large sparse networks with small maximum degree. Social Networks, 23:237-243, 2001.
3. FFF99. Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. On power-law relationships of the Internet topology. In Proceedings of SIGCOMM'99, 1999.
4. SW05. Thomas Schank and Dorothea Wagner. Finding, counting and listing all triangles in large graphs. Technical report, Universität Karlsruhe, Fakultät für Informatik, 2005.