Finding an anti-risk path between two nodes in undirected graphs (Q732313)

From MaRDI portal
Revision as of 23:35, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Finding an anti-risk path between two nodes in undirected graphs
scientific article

    Statements

    Finding an anti-risk path between two nodes in undirected graphs (English)
    0 references
    0 references
    0 references
    0 references
    9 October 2009
    0 references
    0 references
    shortest path
    0 references
    shortest path tree
    0 references
    most vital real time edge
    0 references
    anti-risk path
    0 references
    0 references