Constrained via minimization for three-layer routing

DOI10.1016/0010-4485(89)90001-8zbMATH Open0671.90092OpenAlexW2031800521MaRDI QIDQ1119490

S. H. Smith

Publication date: 1989

Published in: CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0010-4485(89)90001-8

zbMATH Keywords

NP-completecomputer-aided designlayer assignmentcontractability probleminterconnections of netsthree- colourable graphVLSI three-layer routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Constrained via minimization for three-layer routing

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