Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning (Q5894040): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Gary Lee Miller / rank | |||
| Property / author | |||
| Property / author: Gary Lee Miller / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3126084272 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1011.0468 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:12, 19 April 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
