Characteristics of the maximal independent set ZDD (Q405673): Difference between revisions

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