An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model (Q5943315)
From MaRDI portal
scientific article; zbMATH DE number 1642693
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model |
scientific article; zbMATH DE number 1642693 |
Statements
An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model (English)
0 references
27 September 2001
0 references
two-layer interconnection model
0 references
integer data structures
0 references
VLSI routing
0 references