A comparison of approaches for finding minimum identifying codes on graphs (Q296102): Difference between revisions

@@ Property / cites work @@
+Resource efficient gadgets for compiling adiabatic quantum optimization problems
+Normal rank
@@ Property / cites work @@
+Identifying codes on directed de Bruijn graphs
@@ Property / cites work: Identifying codes on directed de Bruijn graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
+Normal rank
@@ Property / cites work @@
+Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
+Normal rank
@@ Property / cites work @@
+Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Adiabatic quantum programming: minor embedding with hard faults
+Normal rank
@@ Property / cites work @@
+Q3286217
@@ Property / cites work: Q3286217 / rank @@
+Normal rank
@@ Property / cites work @@
+A case study in programming a quantum annealer for hard operational planning problems
+Normal rank