Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs (Q2910856)

From MaRDI portal
Revision as of 22:53, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs
scientific article

    Statements

    Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs (English)
    0 references
    0 references
    0 references
    12 September 2012
    0 references
    approximate all-pairs shortest paths problem
    0 references
    unweighted undirected graphs
    0 references
    dynamic algorithms
    0 references

    Identifiers

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