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

From MaRDI portal
Revision as of 07:01, 21 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
scientific article

    Statements

    Identifiers