Near-linear lower bounds for distributed distance computations, even in sparse networks (Q1660917): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2964031269 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1605.05109 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:24, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Near-linear lower bounds for distributed distance computations, even in sparse networks |
scientific article |
Statements
Near-linear lower bounds for distributed distance computations, even in sparse networks (English)
0 references
16 August 2018
0 references
distributed computing
0 references
approximations
0 references
lower bounds
0 references
diameter
0 references
radius
0 references
eccentricity
0 references
spanners
0 references
