Characteristics of the maximal independent set ZDD

DOI10.1007/s10878-014-9722-4zbMath1302.90188OpenAlexW2074844633MaRDI QIDQ405673

Edward C. Sewell, David R. Morrison, Jacobson, Sheldon H.

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

zbMATH Keywords

graph theoryindependent setsbinary decision diagrams

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams

Uses Software

• DIMACS
• Algorithm 457

Cites Work

• Unnamed Item
• Unnamed Item
• The worst-case time complexity for generating all maximal cliques and computational experiments
• Zero-suppressed BDDs and their applications
• Maximum-weight stable sets and safe lower bounds for graph coloring
• Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams
• Optimization Bounds from Binary Decision Diagrams
• On Threshold BDDs and the Optimal Variable Ordering Problem
• Graph-Based Algorithms for Boolean Function Manipulation
• Binary Decision Diagrams
• Improving the variable ordering of OBDDs is NP-complete
• 0/1 vertex and facet enumeration with BDDs
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: Characteristics of the maximal independent set ZDD