The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (Q1662648): Difference between revisions

@@ Property / cites work @@
+Polynomial algorithms in linear programming
@@ Property / cites work: Polynomial algorithms in linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q4324980
@@ Property / cites work: Q4324980 / rank @@
+Normal rank
@@ Property / cites work @@
+A strongly polynomial algorithm for bimodular integer linear programming
+Normal rank
@@ Property / cites work @@
+Integer program with bimodular matrix
@@ Property / cites work: Integer program with bimodular matrix / rank @@
+Normal rank
@@ Property / cites work @@
+A note on non-degenerate integer programs with small sub-determinants
+Normal rank
@@ Property / cites work @@
+Q3425498
@@ Property / cites work: Q3425498 / rank @@
+Normal rank
@@ Property / cites work @@
+On linear and circular structure of (claw, net)-free graphs
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Critical properties of graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Edge dominating set and colorings on graphs with fixed clique-width
+Normal rank