An Algorithm for Minimizing of Boolean Functions Based on Graph DS - TI Journals
Masoud Nosrati, Mehdi Hariri · World Applied Programming · 2012
Abstract: In this paper, we intend to introduce a new heuristic algorithm to apply maximum minimization to Boolean functions with normal SOP form. To implement the proposed algorithm, we use the graph data structure and define the adjacencies. Also, we demonstrate some conditions to achieve the maximum minimization. Through this paper, the problem of shared vertices in more than one adjacency is talked, and the solution is presented. Karnaugh map is used to clarify the matter.