Main-memory triangle computations for very large (sparse (power-law)) graphs
From MaRDI portal
Publication:955020
DOI10.1016/j.tcs.2008.07.017zbMath1152.68045MaRDI QIDQ955020
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.07.017
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Complex Networks and Link Streams for the Empirical Analysis of Large Software, Analyzing the maritime transportation system in Greece: a complex network approach, Colorful triangle counting and a \textsc{MapReduce} implementation, Main-memory triangle computations for very large (sparse (power-law)) graphs, Efficient Computation of the Weighted Clustering Coefficient
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding and counting given length cycles
- Matrix multiplication via arithmetic progressions
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Network analysis. Methodological foundations.
- Color-coding
- Statistical mechanics of complex networks
- Approximating Clustering Coefficient and Transitivity
- Radix Sorting with No Extra Space
- Every monotone graph property is testable
- Arboricity and Subgraph Listing Algorithms
- Finding a Minimum Circuit in a Graph
- Matrix measures for transitivity and balance*
- Coupling Scale-Free and Classical Random Graphs
- Collective dynamics of ‘small-world’ networks
- Algorithms – ESA 2004
- Codes for the World Wide Web
- Experimental and Efficient Algorithms
- Computing and Combinatorics
