An improved Dijkstra's shortest path algorithm for sparse network (Q870157)

From MaRDI portal
Revision as of 15:48, 25 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 improved Dijkstra's shortest path algorithm for sparse network
scientific article

    Statements

    An improved Dijkstra's shortest path algorithm for sparse network (English)
    0 references
    0 references
    12 March 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    Dijkstra's shortest path algorithm
    0 references
    comparison-addition model
    0 references
    Fibonacci heap
    0 references
    numerical examples
    0 references
    sparse networks
    0 references
    road traffic networks
    0 references
    0 references