An O(m log D) algorithm for shortest paths (Q1145158)

From MaRDI portal
Revision as of 10:30, 13 June 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
An O(m log D) algorithm for shortest paths
scientific article

    Statements

    title
    An O(m log D) algorithm for shortest paths (English)
    0 references
    author
    Pierre Hansen
    0 references
    publication date
    1980
    0 references
    Mathematics Subject Classification ID
    05C38
    0 references
    05C35
    0 references
    05-04
    0 references
    68W99
    0 references
    zbMATH DE Number
    3695241
    0 references
    zbMATH Keywords
    Dijkstra's shortest paths algorithm
    0 references
    binary counting tree
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1145158&oldid=34644284"
    Powered by MediaWiki