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

From MaRDI portal
Revision as of 18:44, 15 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q539451)
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