Main-memory triangle computations for very large (sparse (power-law)) graphs (Q955020): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: UbiCrawler / rank | |||
Normal rank |
Revision as of 13:12, 28 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Main-memory triangle computations for very large (sparse (power-law)) graphs |
scientific article |
Statements
Main-memory triangle computations for very large (sparse (power-law)) graphs (English)
0 references
18 November 2008
0 references
graphs
0 references
algorithms
0 references
triangles
0 references
complex networks
0 references