Skip to main content
Conference Proceedings

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

Lecture Notes in Computer Science (2005) 3503 606-609
DOI: 10.1007/11427186_54
198Citations
Citations of this article
85Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Schank, T., & Wagner, D. (2005). Finding, counting and listing all triangles in large graphs, an experimental study. In Lecture Notes in Computer Science (Vol. 3503, pp. 606–609). Springer Verlag. https://doi.org/10.1007/11427186_54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free