Faster Approximation of Distances in Graphs (Q3603556)

From MaRDI portal
Revision as of 12:57, 16 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Faster Approximation of Distances in Graphs
scientific article

    Statements

    Faster Approximation of Distances in Graphs (English)
    0 references
    17 February 2009
    0 references
    weighted undirected graph
    0 references
    shortest path metric
    0 references
    deterministic algorithm
    0 references
    Boolean matrix multiplication
    0 references
    radius of a graph
    0 references
    diameter of a graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references