Symbolic topological sorting with OBDDs: (Extended abstract)

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

Volumn 2747, Issue , 2003, Pages 671-680

  Woelfel, Philipp ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; TOPOLOGY;

GRAPH PROBLEMS; GRID GRAPHS; RUN-TIME ANALYSIS; RUNTIMES; TOPOLOGICAL SORTING; UPPER BOUND;

ALGORITHMS;

EID: 35248832611     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_61     Document Type: Article

References (12)

1. Y. Breitbart, H. B. Hunt III, and D. J. Rosenkrantz. On the size of binary decision diagrams representing boolean functions. Theor. Comp. Sci., 145:45-69, 1995.
2. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. Inform. and Comp., 98:142-170, 1992.
3. H. Cho, G. Hachtel, S.-W. Jeong, B. Plessier, E. Schwarz, and F. Somenzi. ATPG aspects of FSM verification. In IEEE Int. Conf. on CAD, pp. 134-137. 1990.
4. H. Cho, S.-W. Jeong, F. Somenzi, and C. Pixley. Synchronizing sequences and symbolic traversal techniques in test generation. Journal of Electronic Testing: Theory and Applications, 4:19-31, 1993.
5. G. D. Hachtel and F. Somenzi. A symbolic algorithm for maximum flow in 0-1 networks. Formal Methods in System Design, pp. 207-219, 1997.
6. S. Jukna. The graph of integer multiplication is hard for read-k-times networks. Technical Report 95-10, Universität Trier, 1995.
7. M. Keim, R. Drechsler, B. Becker, M. Martin, and P. Molitor. Polynomial formal verification of multipliers. Formal Methods in System Design, 22:39-58, 2003.
8. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In IEEE Int. Conf. on CAD, pp. 42-47. 1993.
9. ∼sawitzki.
10. ∼sawitzki.
11. D. Sawitzki. Implizite Algorithmen für Graphprobleme. Diploma thesis, Univ. Dortmund, 2002.
12. I. Wegener. Branching Programs and Binary Decision Diagrams - Theory and Applications. SIAM, 2000.