Improved algorithms for replacement paths problems in restricted graphs (Q2488196)

From MaRDI portal
Revision as of 15:33, 10 June 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
Improved algorithms for replacement paths problems in restricted graphs
scientific article

    Statements

    Improved algorithms for replacement paths problems in restricted graphs (English)
    0 references
    0 references
    25 August 2005
    0 references
    0 references
    Replacement paths
    0 references
    Most vital arcs
    0 references
    Single link failure recovery
    0 references
    Minimum spanning trees sensitivity
    0 references
    0 references