Finding the anti-block vital edge of a shortest path between two nodes (Q1016036)

From MaRDI portal
Revision as of 13:29, 1 July 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
Finding the anti-block vital edge of a shortest path between two nodes
scientific article

    Statements

    title
    Finding the anti-block vital edge of a shortest path between two nodes (English)
    0 references
    author
    Bing Su
    0 references
    Qingchuan Xu
    0 references
    Peng Xiao
    0 references
    publication date
    4 May 2009
    0 references
    Mathematics Subject Classification ID
    90B10
    0 references
    90C35
    0 references
    05C85
    0 references
    zbMATH DE Number
    5550472
    0 references
    zbMATH Keywords
    edge failures
    0 references
    shortest path
    0 references
    anti-block vital edge
    0 references
    OpenAlex ID
    W2797439625
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1016036&oldid=35106003"
    Powered by MediaWiki