A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing (Q1044022)

From MaRDI portal
Revision as of 14:40, 10 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
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
scientific article

    Statements

    A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing (English)
    0 references
    0 references
    0 references
    0 references
    10 December 2009
    0 references
    Dijkstra's algorithm
    0 references
    physical design
    0 references
    VLSI routing
    0 references

    Identifiers