Pages that link to "Item:Q3684051"
From MaRDI portal
The following pages link to Optimal Three-Layer Channel Routing (Q3684051):
Displayed 18 items.
- Dynamic computational geometry on meshes and hypercubes (Q547490) (← links)
- Optimal algorithms for adjacent side routing (Q802877) (← links)
- Optimal multilayer channel routing with overlap (Q916365) (← links)
- Routing in times square mode (Q917294) (← links)
- Algorithms for routing in planar graphs (Q1075054) (← links)
- Channel routing in knock-knee mode: Simplified algorithms and proofs (Q1091149) (← links)
- Geometric problems on two-dimensional array processors (Q1104746) (← links)
- An efficient parallel logarithmic time algorithm for the channel routing problem (Q1201820) (← links)
- Parity conditions in homotopic knock-knee routing (Q1207328) (← links)
- Maximum \(k\)-covering of weighted transitive graphs with applications (Q1207331) (← links)
- Routings for involutions of a hypercube (Q1315464) (← links)
- Diagonal channel routing with vias at unit distance (Q1346984) (← links)
- A preliminary study of a diagonal channel-routing model (Q1825653) (← links)
- Optimizing area for three-layer knock-knee channel routing (Q1913703) (← links)
- Wiring layouts in the tri-hexagonal grid<sup>∗</sup> (Q3210923) (← links)
- A unified approach to layout wirability (Q3754571) (← links)
- Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays (Q3809272) (← links)
- MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN (Q4682201) (← links)