Main-memory triangle computations for very large (sparse (power-law)) graphs
Open Access
- 6 November 2008
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 407 (1-3), 458-473
- https://doi.org/10.1016/j.tcs.2008.07.017
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Approximating Clustering Coefficient and TransitivityJournal of Graph Algorithms and Applications, 2005
- UbiCrawler: a scalable fully distributed Web crawlerSoftware: Practice and Experience, 2004
- Network Motifs: Simple Building Blocks of Complex NetworksScience, 2002
- Comment on “Breakdown of the Internet under Intentional Attack”Physical Review Letters, 2001
- A subquadratic triad census algorithm for large sparse networks with small maximum degreeSocial Networks, 2001
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Arboricity and Subgraph Listing AlgorithmsSIAM Journal on Computing, 1985
- Matrix measures for transitivity and balance*The Journal of Mathematical Sociology, 1979
- Finding a Minimum Circuit in a GraphSIAM Journal on Computing, 1978
- Toward a General Calculus of Phonemic DistributionLanguage, 1957