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

From MaRDI portal
Revision as of 23:06, 4 May 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56078247, #quickstatements; #temporary_batch_1714856798036)
scientific article
Language Label Description Also known as
English
An O(m log log D) algorithm for shortest paths
scientific article

    Statements

    An O(m log log D) algorithm for shortest paths (English)
    0 references
    0 references
    0 references
    1983
    0 references
    Dijkstra's shortest path algorithm
    0 references
    priority queue
    0 references

    Identifiers