Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning (Q5894040): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:46, 3 February 2024
scientific article; zbMATH DE number 5839865
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
