scientific article; zbMATH DE number 4035743

MaRDI QIDQ3775485zbMATH OpenFDO

Authors Paul Molitor

Publication date 1987

zbMATH Keywords

contact minimization problemmaximum matching for a graphNP-completenumber of layer changespolynomial-time algorithmwiring the signal nets of a circuit

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Constrained via minimization for three-layer routing
• scientific article; zbMATH DE number 3985121
• Performance driven \(k\)-layer wiring
• A hierarchy preserving hierarchical bottom-up 2-layer wiring algorithm with respect to via minimization
• scientific article; zbMATH DE number 3907789

Cited in

(5)

• A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis
• An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
• On Romeo and Juliet problems: minimizing distance-to-sight
• scientific article; zbMATH DE number 3985121 (Why is no real title available?)
• Performance driven \(k\)-layer wiring

This page was built for publication:

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