Efficient distributed computation of distance sketches in networks (Q748116)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6496238
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient distributed computation of distance sketches in networks |
scientific article; zbMATH DE number 6496238 |
Statements
Efficient distributed computation of distance sketches in networks (English)
0 references
20 October 2015
0 references
distributed network
0 references
shortest paths
0 references
distance labeling
0 references
distributed algorithm
0 references
0 references
0.8128692507743835
0 references
0.7570727467536926
0 references
0.748509407043457
0 references
0.7464047074317932
0 references
