Double-row planar routing and permutation layout

DOI10.1002/NET.3230120307MaRDI QIDQ3952043zbMATH OpenOpenAlexFDO

Authors Shuji Tsukiyama, Ernest S. Kuh

Publication date 1982

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

interval graphical representationlayout for integrated circuits and printed circuit boardsNP-completenesspolynomial-time heuristic algorithm

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Deterministic network models in operations research (90B10) Circuits, networks (94C99)

Cites work

• On optimum single-row routing
• The multilayer routing problem: Algorithms and necessary and sufficient conditions for the single-row, single-layer case

Cited in

(3)

• General circular permutation layout
• Multilayer grid embeddings for VLSI
• A lower bound on the area of permutation layouts

This page was built for publication: Double-row planar routing and permutation layout

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3952043)