Output-size sensitiveness of OBDD construction through maximal independent set problem
- 142 Downloads
This paper investigates output-size sensitiveness of construction of OBDD by analyzing the maximal independent set problem of a graph, which would give several insights to efficient manipulation of Boolean functions by OBDD and graph theory.
KeywordsBoolean Function Equivalence Test Variable Node Binary Decision Diagram Tile Size
Unable to display preview. Download preview PDF.
- 1.R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computers, C-35(8):677–691, 1986.Google Scholar
- 2.O. Coudert. Doing two-level logic minimization 100 times faster. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 112–121, 1995.Google Scholar
- 5.S. Tani and H. Imai. A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs. In ISAAC'94, Lecture Notes in Computer Science, volume 834, pages 575–583, 1994.Google Scholar