The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
scientific article

    Statements

    The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 August 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    shortest-path algorithms
    0 references
    parallel algorithm
    0 references
    heuristics
    0 references