Output-size sensitiveness of OBDD construction through maximal independent set problem
From MaRDI portal
Recommendations
- On the size of (generalized) OBDDs for threshold functions
- Computing with restricted nondeterminism: The dependence of the OBDD size on the number of nondeterministic variables
- Least upper bounds for the size of OBDDs using symmetry properties
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
- On the hardness of approximating the minimum consistent OBDD problem
- Size and variable ordering of OBDDs representing threshold functions
- On the evolution of the worst-case OBDD size
- The nonapproximability of OBDD minimization
- Least upper bounds on OBDD sizes
Cites work
- A New Algorithm for Generating All the Maximal Independent Sets
- A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 910866 (Why is no real title available?)
- On generating all maximal independent sets
This page was built for publication: Output-size sensitiveness of OBDD construction through maximal independent set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085711)