Permutation layout

DOI10.1002/NET.3230080308MaRDI QIDQ4189280zbMATH OpenOpenAlexFDO

Authors

Publication date 1978

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230080308

zbMATH Keywords

Node PathsPermutation Layout

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph theory (05C99)

Recommendations

• A lower bound on the area of permutation layouts
• General circular permutation layout
• Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout
• On the Optimal Layout of Planar Graphs with Fixed Boundary
• scientific article; zbMATH DE number 3906407

Cites work

• The crossing number of K5,n

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)