What graphs can be efficiently represented by BDDs?

Proceedings - International Conference on Computing: Theory and Applications, ICCTA 2007

Volumn , Issue , 2007, Pages 128-134

  Dong, C ^a   Molitor, P ^a  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; GRAPH THEORY; MATRIX ALGEBRA; WORLD WIDE WEB;

DENSE GRAPHS; GRAPH EDGES; ORDERED BINARY DECISION DIAGRAMS (OBDDS); SOCIAL NETWORKS;

BINARY DECISION DIAGRAMS;

EID: 34547294303     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCTA.2007.133     Document Type: Conference Paper

References (14)

1. Y. Breitbart, H. H. III, and D. Rosenkrantz. On the size of binary decision diagrams representing Boolean functions. Theoretical Computer Sciences, 145:45-69, 1995.
2. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans, on Computers, C35(8):677-691, 1986.
3. R. E. Bryant. Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
4. R. Drechsler and B. Becker. Binary Decision Diagrams Theory and Implementation. Kluwer Academic Publishers, 1998.
5. R. Forth and P. Molitor. An efficient heuristic for state encoding minimizing the BDD representations of the transition relations of finite state machines. In Proceedings of the IEEE/ACM Asia and South Pacific Design Automation Conference ASP-DAC, pages 61-66, 2000.
6. R. Gentilini, C. Piazza, and A. Policriti. Computing strongly connected components in a linear number of symbolic steps. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 572-582, 2003.
7. M. A. Heap and M. R. Mercer. Least upper bounds on OBDD sizes. IEEE Transactions on Computers, 43(6):764-767, 1994.
8. J. Lind-Nielsen. BuDDy: Binary Decision Diagram Package, Release 2.2, 2002.
9. C. Meinel and T. Theobald. Algorithmen und Datenstrukturen im VLSI-Design, OBDD Grundlagen und Anwendungen. Springer, 1998.
10. S. I. Minato. Zero-suppressed BDDs for set manipulation in combinatorial problems. In Proceedings of the Design Automation Conference, pages 272-277, 1993.
11. R. Nunkesser. Zur impliziten Darstellung von Graphen durch OBDDs. Univ. Dortmund, 2005. Vortragsfolien.
12. E Somenzi. CUDD: CU Decision Diagram Package, Release 2.4.0, 2004.
13. I. Wegener. Branching Programs and Binary Decision Diagrams, Theory and Applications. SIAM, 2000.
14. P. Woelfel. Symbolic topological sorting with OBDDs. In Proc. of the 28th Int'l Symp. on Mathematical Foundations of Computer Science, pages 671-680, Bratislava, 2003.