Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling (Q5145219)

From MaRDI portal
Revision as of 04:16, 17 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7298686
Language Label Description Also known as
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
    0 references
    0 references
    0 references
    20 January 2021
    0 references
    distance labeling
    0 references
    hub labeling
    0 references
    lower bound
    0 references
    Ruzsa-Szemeredi function
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references