A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing (Q1044022): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jda.2007.08.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JDA.2007.08.003 / rank | |||
Normal rank | |||
Latest revision as of 14:40, 10 December 2024
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
10 December 2009
0 references
Dijkstra's algorithm
0 references
physical design
0 references
VLSI routing
0 references
