scientific article; zbMATH DE number 3922544

MaRDI QIDQ3698710zbMATH OpenFDO

Authors Ravi Nair, Anna R. Bruss, J. Reif

Publication date 1985

zbMATH Keywords

CMOS combinational circuit layoutdual-Eulerian graphminimal complete set of pathsminimal width layoutnegative unate Boolean functionsoptimal VLSI layoutseries- parallel graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 3959289
• Euler paths in series parallel graphs
• An algebraic technique for generating optimal CMOS circuitry in linear time
• A logic-topological calculus for the construction of integrated circuits. II.
• scientific article; zbMATH DE number 49142

Cited in

(11)

• An assignment algorithm with applications to integrated circuit layout
• A logic-topological calculus for the construction of integrated circuits. II.
• Transistor chaining in static CMOS functional cells of arbitrary planar topology
• An algebraic technique for generating optimal CMOS circuitry in linear time
• Finding Double Euler Trails of Planar Graphs in Linear Time
• scientific article; zbMATH DE number 3959289 (Why is no real title available?)
• Linear placement algorithms and applications to VLSI design
• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• scientific article; zbMATH DE number 833244 (Why is no real title available?)
• Euler paths in series parallel graphs
• Application of graph theory to topology generation for logic gates

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 Q3698710)