Waypoint routing on bounded treewidth graphs (Q2234792): Difference between revisions

@@ Property / cites work @@
+Walking through waypoints
@@ Property / cites work: Walking through waypoints / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest Two Disjoint Paths in Polynomial Time
@@ Property / cites work: Shortest Two Disjoint Paths in Polynomial Time / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743515
@@ Property / cites work: Q5743515 / rank @@
+Normal rank
@@ Property / cites work @@
+A subexponential parameterized algorithm for Subset TSP on planar graphs
+Normal rank
@@ Property / cites work @@
+Service chain placement in SDNs
@@ Property / cites work: Service chain placement in SDNs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Theory
@@ Property / cites work: Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A $c^k n$ 5-Approximation Algorithm for Treewidth
@@ Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Many Visits to Few Cities
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Monadic second-order evaluations on tree-decomposable graphs
+Normal rank
@@ Property / cites work @@
+Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank