Shortest-path feasibility algorithms (Q5406208)

From MaRDI portal
Revision as of 22:46, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6276662
Language Label Description Also known as
English
Shortest-path feasibility algorithms
scientific article; zbMATH DE number 6276662

    Statements

    title
    Shortest-path feasibility algorithms (English)
    0 references
    author
    Boris V. Cherkassky
    0 references
    Loukas Georgiadis
    0 references
    Andrew V. Goldberg
    0 references
    Renato F. Werneck
    0 references
    Robert Endre Tarjan
    0 references
    publication date
    1 April 2014
    0 references
    zbMATH Keywords
    Shortest paths
    0 references
    feasibility
    0 references
    negative cycles
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C20
    0 references
    05C35
    0 references
    zbMATH DE Number
    6276662
    0 references
    OpenAlex ID
    W2049745956
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5406208&oldid=32242189"
    Powered by MediaWiki