Finding next-to-shortest paths in a graph (Q834912)

From MaRDI portal
Revision as of 02:20, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Finding next-to-shortest paths in a graph
scientific article

    Statements

    title
    Finding next-to-shortest paths in a graph (English)
    0 references
    publication date
    27 August 2009
    0 references
    zbMATH DE Number
    5599143
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    computational complexity
    0 references
    shortest paths
    0 references
    author
    Ilia Krasikov
    0 references
    Steven D. Noble
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q834912&oldid=25813510"
    Powered by MediaWiki