Fast computation of empirically tight bounds for the diameter of massive graphs (Q5406179): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2034050320 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0904.2728 / rank | |||
Normal rank | |||
Latest revision as of 01:59, 20 April 2024
scientific article; zbMATH DE number 6276637
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast computation of empirically tight bounds for the diameter of massive graphs |
scientific article; zbMATH DE number 6276637 |
Statements
Fast computation of empirically tight bounds for the diameter of massive graphs (English)
0 references
1 April 2014
0 references
diameter bounds
0 references
graph diameter
0 references
