A graph theoretic approach to switching function minimization

DOI10.1016/0016-0032(82)90005-9zbMath0493.94018OpenAlexW2000845302MaRDI QIDQ1168952

Kabekode V. S. Bhat

Publication date: 1982

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(82)90005-9

zbMATH Keywords

prime implicantgraph of a truth function

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of testing a graph for n-cube
• Minimization of disjunctive normal forms of fuzzy logic functions
• A characterization of hypercubes
• Parallel concepts in graph theory
• On the computational power of pushdown automata
• Distance-preserving subgraphs of hypercubes
• Algebraic Topological Methods for the Synthesis of Switching Systems. I
• The Computational Complexity of a Class of Minimization Algorithms for Switching Functions
• Useless prime implicants of incompletely specified multiple-output switching functions
• Minimization of Switching Functions—A Fast Technique
• A Prime Implicant Algorithm with Factoring
• Heuristic Algorithm for Reducing Large Product-of-Sums Logical Expressions
• A New Technique for the Fast Minimization of Switching Functions
• Irredundant Normal Forms and Minimal Dependence Sets of a Boolean Function
• Computationally Related Problems
• Fault Detection in Redundant Circuits
• Irreducible Topological Components of an Arbitrary Boolean Truth Function and Generation of Their Minimal Coverings
• RST Flip-Flop Input Equations
• Minimization of Boolean Functions
• Depth-First Search and Linear Graph Algorithms
• The Problem of Simplifying Truth Functions

This page was built for publication: A graph theoretic approach to switching function minimization