Permutation layout
From MaRDI portal
Publication:4189280
Recommendations
Cites work
Cited in
(12)- General circular permutation layout
- Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
- A lower bound on the area of permutation layouts
- scientific article; zbMATH DE number 59348 (Why is no real title available?)
- Efficient enumeration of all ladder lotteries and its application
- scientific article; zbMATH DE number 2084291 (Why is no real title available?)
- Drawing permutations with few corners
- Multilayer grid embeddings for VLSI
- Improved approximation for node-disjoint paths in grids with sources on the boundary
- Few sequence pairs suffice: representing all rectangle placements
- Asymptotic component densities in programmable gate arrays realizing all circuits of a given size
- A note on solving the fleet quickest routing problem on a grid graph
This page was built for publication: Permutation layout
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4189280)