A faster computation of all the best swap edges of a shortest paths tree (Q893317)

From MaRDI portal
Revision as of 03:12, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A faster computation of all the best swap edges of a shortest paths tree
scientific article

    Statements

    A faster computation of all the best swap edges of a shortest paths tree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 November 2015
    0 references
    single-source shortest paths tree
    0 references
    edge fault tolerance
    0 references
    swap algorithms
    0 references

    Identifiers