Abstract
Binary decision diagrams have been shown as a powerful paradigm in handling Boolean functions and have been applied to many fields such as VLSI CAD, AI, combinatorics, etc. This paper proposes a new operation on an ordered binary decision diagram (OBDD), called reordering, and demonstrates its usefulness with presenting an extended algorithmic framework of applying OBDDs to combinatorial graph enumeration problems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. B. Akers: “Binary Decision Diagrams”, IEEE Trans. on Computers, C-27(1978), pp.509–516.
K. S. Brace, R. L. Rudell and R. Bryant: “Efficient Implementation of a BDD Package”, Proc. 27th Design Automation Conference (1990), pp.40–45.
R. E. Bryant: “Graph Based Algorithms for Boolean Function Manipulation”, IEEE Trans. on Computers, C-35 (1986), pp.677–691.
J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and J. Hwang: “Symbolic model checking: 1020 states and beyond”, Proc. 5th Annual Symposium on Logic in Computer Science (1990), pp. 428–439.
M. Fujita, Y. Matsunaga and T. Kakuda: “On Variable Ordering of Binary Decision Diagrams for the Application of Multilevel Logic Synthesis”, Proc. European Conference on Design Automation (1991).
N. Ishiura, H. Sawada and S. Yajima: “Minimization of Binary Decision Diagrams Based on Exchanges of Variables”, Proc. International Conference on Computer-Aided Design 91 (1991), pp.472–475.
S. Minato, N. Ishiura and S. Yajima: “Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean Function Manipulation”, Proc. 27th Design Automation Conference (1990), pp.52–57.
K. Murota: Systems Analysis by Graphs and Matroids — Structural Solvability and Controllability. Springer-Verlag, 1987.
H. Okuno: “Reducing Combinatorial Expressions in Solving Search-Type Combinatorial Problems with Binary Decision Diagrams (in Japanese)”, Trans. Information Processing Society of Japan, 35, 5 (1994), pp. 739–753.
H. Ochi, K. Yasuoka and S. Yajima: “Breadth-First Manipulation of Very Large Binary-Decision Diagrams”, Proc. International Conference on Computer-Aided Design 93 (1993), pp.48–55.
R. Rudell: “Dynamic Variable Ordering for Ordered Binary Decision Diagrams”, Proc. International Conference on Computer-Aided Design 93 (1993), pp.42–47.
I. Semba and S. Yajima: “Combinatorial Algorithms by Boolean Processing I, II”, IPSJ SIG Notes SIGAL-32-4, SIGAL-32-5 (1993).
S. Tani, K. Hamaguchi and S. Yajima: “The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams”, ISAAC'93, Lecture Notes in Computer Science, 762 (1993), pp.389–398.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tani, S., Imai, H. (1994). A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_225
Download citation
DOI: https://doi.org/10.1007/3-540-58325-4_225
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58325-7
Online ISBN: 978-3-540-48653-4
eBook Packages: Springer Book Archive