Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1137/22m1489034 / rank | |||
| Property / cites work | |||
| Property / cites work: Near-optimal approximate shortest paths and transshipment in distributed and streaming models / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1137/22M1489034 / rank | |||
Normal rank | |||
Latest revision as of 18:57, 30 December 2024
scientific article; zbMATH DE number 7820560
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions |
scientific article; zbMATH DE number 7820560 |
Statements
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (English)
0 references
19 March 2024
0 references
distributed graph algorithms
0 references
parallel graph algorithms
0 references
(semi-)streaming graph algorithms
0 references
metric tree embeddings
0 references
low-stretch trees
0 references
graph decompositions
0 references
0 references
0 references
0 references
0 references
0 references
0 references
