Constrained via minimization for three-layer routing
From MaRDI portal
Publication:1119490
DOI10.1016/0010-4485(89)90001-8zbMath0671.90092MaRDI QIDQ1119490
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
NP-complete; computer-aided design; layer assignment; contractability problem; interconnections of nets; three- colourable graph; VLSI three-layer routing
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research
05C15: Coloring of graphs and hypergraphs