Threshold dominating cliques in random graphs and interval routing (Q1044044): Difference between revisions

@@ Property / cites work @@
+Q2743189
@@ Property / cites work: Q2743189 / rank @@
+Normal rank
@@ Property / cites work @@
+Threshold dominating sets and an improved characterization of \(W[2]\)
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Interval Routing on Random Graphs
+Normal rank
@@ Property / cites work @@
+Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms
+Normal rank
@@ Property / cites work @@
+A survey on interval routing
@@ Property / cites work: A survey on interval routing / rank @@
+Normal rank
@@ Property / cites work @@
+The Compactness of Interval Routing for Almost All Graphs
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the minimum dominating clique problem
+Normal rank
@@ Property / cites work @@
+Q3496342
@@ Property / cites work: Q3496342 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank