Efficient triangle counting in large graphs via degree-based vertex partitioning (Q5891737)
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: Efficient triangle counting in large graphs via degree-based vertex partitioning |
scientific article; zbMATH DE number 6073895
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient triangle counting in large graphs via degree-based vertex partitioning |
scientific article; zbMATH DE number 6073895 |
Statements
29 August 2012
0 references
Efficient triangle counting in large graphs via degree-based vertex partitioning (English)
0 references
