Abstract

Abstract. We present a symbolic OBDD algorithm for topological sorting which requires O(log 2 N) OBDD operations. Then we analyze its true runtime for the directed grid graph and show an upper bound of O(log 4 N). This is the first true runtime analysis of a symbolic OBDD algorithm for a fundamental graph problem, and it demonstrates that one can hope that the algorithm behaves well for sufficiently structured inputs. 1

Citations

386	Dynamic Variable Ordering for Ordered Binary Decision Diagrams - Rudell - 1993
135	Branching Programs and Binary Decision Diagrams—Theory and Applications - Wegener - 2000
84	Symbolic Model Checking - Burch, Clarke, et al. - 1992
28	Rosenkrantz: The Size of Binary Decision Diagrams Representing Boolean Functions - Breitbart, D - 1991
23	Synchronizing Sequences and Symbolic Traversal Techniques in Test Generation - Cho, Jeong, et al. - 1993
14	ATPG aspects of FSM verification - Cho, Hachtel, et al. - 1990
10	A symbolic algorithm for maximum flow - Hachtel, Somenzi - 1997
10	Polynomial formal verification of multipliers - Keim, Drechsler, et al.
9	The graph of integer multiplication is hard for read-k-times networks - Jukna - 1995
8	Implicit flow maximization by iterative squaring - Sawitzki
2	Implizite Algorithmen für Graphprobleme. Diploma thesis - Sawitzki - 2002
1	Implicit flow maximization on grid networks - Sawitzki