A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 834 LNCS, Issue , 1994, Pages 575-583

  Tani, Seiichiro ^a   Imai, Hiroshi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS;

ALGORITHMIC FRAMEWORK; BINARY DECISION; COMBINATORIAL GRAPHS; COMBINATORICS; ENUMERATION PROBLEMS; ORDERED BINARY DECISION DIAGRAMS; VLSI CAD;

COMBINATORIAL MATHEMATICS;

EID: 84990245613     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58325-4_225     Document Type: Conference Paper

References (13)

1. S. B. Akers: “Binary Decision Diagrams”, IEEE Trans. on Computers, C-27(1978), pp.509-516.
2. K. S. Brace, R. L. Rudell and R. Bryant: “Efficient Implementation of a BDD Package”, Proc. 27th Design Automation Conference (1990), pp.40-45.
3. R. E. Bryant: “Graph Based Algorithms for Boolean Function Manipulation”, IEEE Trans. on Computers, C-35 (1986), pp.677-691.
4. 20 states and beyond”, Proc. 5th Annual Symposium on Logic in Computer Science (1990), pp. 428-439.
5. 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).
6. 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.
7. 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.
8. K. Murota: Systems Analysis by Graphs and Matroids - Structural Solvability and Controllability. Springer-Verlag, 1987.
9. 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.
10. 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.
11. R. Rudell: “Dynamic Variable Ordering for Ordered Binary Decision Diagrams”, Proc. International Conference on Computer-Aided Design 93 (1993), pp.42-47.
12. I. Semba and S. Yajima: “Combinatorial Algorithms by Boolean Processing I, II”, IPSJ SIG Notes SIGAL-32-4, SIGAL-32-5 (1993).
13. 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.