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

From MaRDI portal
Revision as of 02:19, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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