Symbolic topological sorting with OBDDs |
| |
Authors: | Philipp Woelfel |
| |
Affiliation: | University Dortmund, FB Informatik 2, D-44221 Dortmund, Germany |
| |
Abstract: | We present a symbolic OBDD algorithm for topological sorting which requires O(log2|V|) OBDD operations. Then we analyze its true runtime for the directed grid graph and show an upper bound of O(log4|V|loglog|V|). 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. |
| |
Keywords: | Implicit graph algorithms Topological sorting OBDDs |
本文献已被 ScienceDirect 等数据库收录! |