Symbolic topological sorting with OBDDs

DOI10.1016/j.jda.2005.01.008zbMath1128.68030OpenAlexW2092805110MaRDI QIDQ2465997

Philipp Woelfel

Publication date: 11 January 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2005.01.008

zbMATH Keywords

implicit graph algorithmstopological sorting

Mathematics Subject Classification ID

Related Items (16)

Randomized OBDD-based graph algorithms ⋮ Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations ⋮ On the OBDD representation of some graph classes ⋮ Randomized OBDD-Based Graph Algorithms ⋮ Exponential space complexity for OBDD-based reachability analysis ⋮ On symbolic OBDD-based algorithms for the minimum spanning tree problem ⋮ Priority functions for the approximation of the metric TSP ⋮ On efficient implicit OBDD-based algorithms for maximal matchings ⋮ Implicit computation of maximum bipartite matchings by sublinear functional operations ⋮ On the minimization of (complete) ordered binary decision diagrams ⋮ Larger lower bounds on the OBDD complexity of integer multiplication ⋮ On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem ⋮ On the size of (generalized) OBDDs for threshold functions ⋮ Larger Lower Bounds on the OBDD Complexity of Integer Multiplication ⋮ On the OBDD size for graphs of bounded tree- and clique-width ⋮ On the width of regular classes of finite structures

Cites Work

• Unnamed Item
• On the size of binary decision diagrams representing Boolean functions
• Symbolic model checking: \(10^{20}\) states and beyond
• Graph-Based Algorithms for Boolean Function Manipulation
• Branching Programs and Binary Decision Diagrams
• Pseudo-Kronecker expressions for symmetric functions
• SOFSEM 2004: Theory and Practice of Computer Science

This page was built for publication: Symbolic topological sorting with OBDDs