More results on the complexity of identifying problems in graphs (Q264560): Difference between revisions

@@ Property / author @@
-Antoine C. Lobstein
@@ Property / author: Antoine C. Lobstein / rank @@
-Normal rank
@@ Property / author @@
+Antoine C. Lobstein
@@ Property / author: Antoine C. Lobstein / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2016.01.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2276120567
@@ Property / OpenAlex ID: W2276120567 / rank @@
+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 @@
+New identifying codes in the binary Hamming space
@@ Property / cites work: New identifying codes in the binary Hamming space / 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 @@
+Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
+Normal rank
@@ Property / cites work @@
+Identifying Codes in Line Graphs
@@ Property / cites work: Identifying Codes in Line Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of Kemeny elections
@@ Property / cites work: The complexity of Kemeny elections / rank @@
+Normal rank
@@ Property / cites work @@
+Q4510800
@@ Property / cites work: Q4510800 / rank @@
+Normal rank
@@ Property / cites work @@
+On identifying codes in binary Hamming spaces
@@ Property / cites work: On identifying codes in binary Hamming spaces / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the identification problem in Hamming spaces
+Normal rank
@@ Property / cites work @@
+On the complexity of Slater's problems
@@ Property / cites work: On the complexity of Slater's problems / rank @@
+Normal rank
@@ Property / cites work @@
+More results on the complexity of identifying problems in graphs
+Normal rank
@@ Property / cites work @@
+Q4385525
@@ Property / cites work: Q4385525 / rank @@
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:264560