Shortest paths algorithms: Theory and experimental evaluation (Q1919099)

From MaRDI portal
Revision as of 02:53, 14 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/mp/CherkasskyGR96, #quickstatements; #temporary_batch_1731547958265)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Shortest paths algorithms: Theory and experimental evaluation
scientific article

    Statements

    title
    Shortest paths algorithms: Theory and experimental evaluation (English)
    0 references
    author
    Boris V. Cherkassky
    0 references
    Andrew V. Goldberg
    0 references
    Tomasz Radzik
    0 references
    publication date
    20 October 1996
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    network optimization
    0 references
    computational study
    0 references
    shortest paths algorithms
    0 references

    Identifiers

    DOI
    10.1007/BF02592101
    0 references
    zbMATH DE Number
    912386
    0 references
    Wikidata QID
    Q28048899
    0 references
    OpenAlex ID
    W3137299218
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1919099&oldid=37913761"
    Powered by MediaWiki