A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing (Q1044022)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5645002
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing |
scientific article; zbMATH DE number 5645002 |
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
0.8402109146118164
0 references
0.8389999270439148
0 references
0.7993687987327576
0 references
0.783515214920044
0 references
