Swapping a failing edge of a single source shortest paths tree is good and fast (Q1566374)

From MaRDI portal
Revision as of 21:29, 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
Swapping a failing edge of a single source shortest paths tree is good and fast
scientific article

    Statements

    Swapping a failing edge of a single source shortest paths tree is good and fast (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 June 2003
    0 references
    network survivability
    0 references
    single source shortest paths tree
    0 references
    swap algorithms
    0 references

    Identifiers