Assigning channels via the meet-in-the-middle approach (Q289931): Difference between revisions

@@ Property / Wikidata QID @@
+Q59472706
@@ Property / Wikidata QID: Q59472706 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Paths and Packings in Halves
@@ Property / cites work: Counting Paths and Packings in Halves / rank @@
+Normal rank
@@ Property / cites work @@
+Set Partitioning via Inclusion-Exclusion
@@ Property / cites work: Set Partitioning via Inclusion-Exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time
+Normal rank
@@ Property / cites work @@
+Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
+Normal rank
@@ Property / cites work @@
+Channel assignment via fast zeta transform
@@ Property / cites work: Channel assignment via fast zeta transform / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Partitions with Applications to the Knapsack Problem
+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 @@
+Fast exact algorithm for \(L(2,1)\)-labeling of graphs
+Normal rank
@@ Property / cites work @@
+An Exact Algorithm for the Generalized List $T$-Coloring Problem
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the channel assignment problem
+Normal rank
@@ Property / cites work @@
+On the span in channel assignment problems: Bounds, computing and counting
+Normal rank
@@ Property / cites work @@
+Tight lower bound for the channel assignment problem
+Normal rank
@@ Property / cites work @@
+The Time Complexity of Constraint Satisfaction
@@ Property / cites work: The Time Complexity of Constraint Satisfaction / rank @@
+Normal rank