scientific article
From MaRDI portal
Publication:3775485
zbMath0635.94027MaRDI QIDQ3775485
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial-time algorithmNP-completecontact minimization problemmaximum matching for a graphnumber of layer changeswiring the signal nets of a circuit
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15)
Related Items
An approximate max-flow min-cut relation for undirected multicommodity flow, with applications, Performance driven k-layer wiring, A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis