Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054): Difference between revisions

@@ Property / cites work @@
+On the unique satisfiability problem
@@ Property / cites work: On the unique satisfiability problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3089301
@@ Property / cites work: Q3089301 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs
+Normal rank
@@ Property / cites work @@
+Block graphs with unique minimum dominating sets
@@ Property / cites work: Block graphs with unique minimum dominating sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4863436
@@ Property / cites work: Q4863436 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of unique solutions
@@ Property / cites work: On the complexity of unique solutions / rank @@
+Normal rank
@@ Property / cites work @@
+Q5615282
@@ Property / cites work: Q5615282 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Q3789614
@@ Property / cites work: Q3789614 / 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 @@
+Q2717197
@@ Property / cites work: Q2717197 / rank @@
+Normal rank
@@ Property / cites work @@
+More results on the complexity of identifying problems in graphs
+Normal rank
@@ Property / cites work @@
+On the number of optimal identifying codes in a twin-free graph
+Normal rank
@@ Property / cites work @@
+On the ensemble of optimal dominating and locating-dominating codes in a graph
+Normal rank
@@ Property / cites work @@
+On the ensemble of optimal identifying codes in a twin-free graph
+Normal rank
@@ Property / cites work @@
+Identifying Codes in Trees and Planar Graphs
@@ Property / cites work: Identifying Codes in Trees and Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal identifying codes in trees and planar graphs with large girth
+Normal rank
@@ Property / cites work @@
+Complexity results for identifying codes in planar graphs
+Normal rank
@@ Property / cites work @@
+Identifying Codes in Line Graphs
@@ Property / cites work: Identifying Codes in Line Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
+Normal rank
@@ Property / cites work @@
+Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
+Normal rank
@@ Property / cites work @@
+Q2867320
@@ Property / cites work: Q2867320 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability of identifying codes and locating-dominating codes
+Normal rank
@@ Property / cites work @@
+The complexity of facets (and some facets of complexity)
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385525
@@ Property / cites work: Q4385525 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4239067
@@ Property / cites work: Q4239067 / rank @@
+Normal rank