Randomized OBDD-Based Graph Algorithms
From MaRDI portal
Publication:3460720
DOI10.1007/978-3-319-25258-2_18zbMath1407.68532OpenAlexW2295004524MaRDI QIDQ3460720
Publication date: 8 January 2016
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-25258-2_18
Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Randomized algorithms (68W20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On symbolic OBDD-based algorithms for the minimum spanning tree problem
- On efficient implicit OBDD-based algorithms for maximal matchings
- An optimal bit complexity randomized distributed MIS algorithm
- On the effect of local changes in the variable ordering of ordered decision diagrams
- Representation of graphs by OBDDs
- On the OBDD size for graphs of bounded tree- and clique-width
- A fast and simple randomized parallel algorithm for maximal matching
- Entropy of contact circuits and lower bounds on their complexity
- On the power of two-point based sampling
- Symbolic model checking: \(10^{20}\) states and beyond
- The space complexity of approximating the frequency moments
- Almost \(k\)-wise independence and hard Boolean functions.
- Priority functions for the approximation of the metric TSP
- Symbolic topological sorting with OBDDs
- Symbolic graphs: Linear solutions to connectivity related problems
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- OBDD-Based Representation of Interval Graphs
- Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations
- The university of Florida sparse matrix collection
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
- Graph-Based Algorithms for Boolean Function Manipulation
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Locality in Distributed Graph Algorithms
- Simple Constructions of Almost k-wise Independent Random Variables
- The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
- Branching Programs and Binary Decision Diagrams
- Improved boolean formulas for the Ramsey graphs
- SOFSEM 2006: Theory and Practice of Computer Science
- SOFSEM 2004: Theory and Practice of Computer Science
This page was built for publication: Randomized OBDD-Based Graph Algorithms
