Efficient triangle counting in large graphs via degree-based vertex partitioning (Q5894040)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5839865
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient triangle counting in large graphs via degree-based vertex partitioning |
scientific article; zbMATH DE number 5839865 |
Statements
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning (English)
0 references
21 January 2011
0 references
0.94673752784729
0 references
0.8568536043167114
0 references
0.8559631705284119
0 references
0.854759931564331
0 references
