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

From MaRDI portal
Revision as of 20:56, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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