Randomized OBDD-based graph algorithms
From MaRDI portal
Publication:1625606
DOI10.1016/j.tcs.2016.11.028zbMath1407.68533OpenAlexW2552670115MaRDI QIDQ1625606
Publication date: 29 November 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.11.028
matchingminimum spanning tree\(k\)-wise independenceordered binary decision diagramalmost \(k\)-wise independencerandomized implicit algorithm
Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Randomized algorithms (68W20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On symbolic OBDD-based algorithms for the minimum spanning tree problem
- On efficient implicit OBDD-based algorithms for maximal matchings
- Implicit computation of maximum bipartite matchings by sublinear functional operations
- 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
- Almost \(k\)-wise independence versus \(k\)-wise independence
- 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
- New hash functions and their use in authentication and set equality
- Symbolic model checking: \(10^{20}\) states and beyond
- The space complexity of approximating the frequency moments
- The probabilistic method yields deterministic parallel algorithms
- On a set of almost deterministic k-independent random variables
- 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
- 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
- A randomized linear-time algorithm to find minimum spanning trees
- The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
- Branching Programs and Binary Decision Diagrams
- On Universal Classes of Extremely Random Constant-Time Hash Functions
- Improved boolean formulas for the Ramsey graphs
- Solving maximum flow problems on real-world bipartite graphs
- Probability and Computing
- 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
