Skip to main content
Article thumbnail
Location of Repository

Symbolic Topological Sorting with OBDDs

By Philipp Woelfel


We present a symbolic OBDD algorithm for topological sorting which requires O(logĀ² |V|) OBDD operations. Then we analyze its true runtime for the directed grid graph and show an upper bound of O(log^4 |V| * log log |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

Year: 2009
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.