Main-memory triangle computations for very large (sparse (power-law)) graphs (Q955020)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Main-memory triangle computations for very large (sparse (power-law)) graphs |
scientific article; zbMATH DE number 5368349
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Main-memory triangle computations for very large (sparse (power-law)) graphs |
scientific article; zbMATH DE number 5368349 |
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
0 references
0.8663413524627686
0 references
0.8207589387893677
0 references
0.8202431201934814
0 references
0.816943883895874
0 references
0.8125084638595581
0 references
