Improved worst-case complexity for the MIN 3-SET COVERING problem (Q2643796): Difference between revisions

@@ Property / cites work @@
+-coloring in time
@@ Property / cites work: 3-coloring in time / rank @@
+Normal rank
@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768314
@@ Property / cites work: Q2768314 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Pathwidth of cubic graphs and exact algorithms
@@ Property / cites work: Pathwidth of cubic graphs and exact algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the complexity of minimum dominating set
+Normal rank
@@ Property / cites work @@
+Q4747916
@@ Property / cites work: Q4747916 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414647
@@ Property / cites work: Q4414647 / rank @@
+Normal rank