Hardness of exact distance queries in sparse graphs through hub labeling (Q5145219)
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 7298686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness of exact distance queries in sparse graphs through hub labeling |
scientific article; zbMATH DE number 7298686 |
Statements
Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling (English)
0 references
20 January 2021
0 references
distance labeling
0 references
hub labeling
0 references
lower bound
0 references
Ruzsa-Szemeredi function
0 references
0.8594091534614563
0 references
0.8512160181999207
0 references
0.7950090765953064
0 references
0.7808667421340942
0 references
0.7714177966117859
0 references
