Characteristics of the maximal independent set ZDD
From MaRDI portal
Publication:405673
DOI10.1007/S10878-014-9722-4zbMATH Open1302.90188OpenAlexW2074844633MaRDI QIDQ405673FDOQ405673
Authors: David R. Morrison, E. C. Sewell, Sheldon H. Jacobson 
Publication date: 5 September 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9722-4
Recommendations
Cites Work
- On Threshold BDDs and the Optimal Variable Ordering Problem
- Algorithm 457: finding all cliques of an undirected graph
- Graph-Based Algorithms for Boolean Function Manipulation
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Binary Decision Diagrams
- Zero-suppressed BDDs and their applications
- Improving the variable ordering of OBDDs is NP-complete
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Optimization Bounds from Binary Decision Diagrams
- Title not available (Why is that?)
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- 0/1 vertex and facet enumeration with BDDs
- Title not available (Why is that?)
Cited In (7)
- DenseZDD: a compact and fast index for families of sets
- Extracting co-occurrence relations from ZDDs
- Zero-suppression and computation models
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- Finding all solutions and instances of Numberlink and Slitherlink by ZDDs
- Enumerating all subgraphs under given constraints using zero-suppressed sentential decision diagrams
- Zero-suppressed BDDs and their applications
Uses Software
This page was built for publication: Characteristics of the maximal independent set ZDD
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405673)
