Finding the detour-critical edge of a shortest path between two nodes (Q293313)

From MaRDI portal
Revision as of 11:59, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding the detour-critical edge of a shortest path between two nodes
scientific article

    Statements

    Finding the detour-critical edge of a shortest path between two nodes (English)
    0 references
    0 references
    0 references
    0 references
    9 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    shortest path
    0 references
    fault tolerance
    0 references
    transient edge failures
    0 references
    longest detour
    0 references
    most critical edge
    0 references
    0 references