Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm (Q3439133)

From MaRDI portal
Revision as of 04:22, 28 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
scientific article

    Statements

    Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm (English)
    0 references
    0 references
    0 references
    29 May 2007
    0 references

    Identifiers