Fully dynamic randomized algorithms for graph spanners (Q3189078)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Fully dynamic randomized algorithms for graph spanners
scientific article

    Statements

    Fully dynamic randomized algorithms for graph spanners (English)
    0 references
    0 references
    0 references
    0 references
    9 September 2014
    0 references
    graph algorithms
    0 references
    approximate shortest paths
    0 references
    dynamic algorithm
    0 references
    graph spanner
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references