Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization (Q537589): Difference between revisions

@@ Property / author @@
+Dominique de Werra
@@ Property / author: Dominique de Werra / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2067750021
@@ Property / OpenAlex ID: W2067750021 / rank @@
+Normal rank
@@ Property / cites work @@
+Struction revisited
@@ Property / cites work: Struction revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Q5668821
@@ Property / cites work: Q5668821 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3682509
@@ Property / cites work: Q3682509 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomially solvable cases for the maximum stable set problem
+Normal rank
@@ Property / cites work @@
+On the use of Boolean methods for the computation of the stability number
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Stability in CAN-free graphs
@@ Property / cites work: Stability in CAN-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The struction of a graph: Application to CN-free graphs
+Normal rank