On two variations of identifying codes (Q2275454): Difference between revisions

@@ Property / OpenAlex ID @@
+W1582377591
@@ Property / OpenAlex ID: W1582377591 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4063
@@ Property / arXiv ID: 1004.4063 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4659582
@@ Property / cites work: Q4659582 / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying and locating-dominating codes on chains and cycles
+Normal rank
@@ Property / cites work @@
+A linear algorithm for minimum 1-identifying codes in oriented trees
+Normal rank
@@ Property / cites work @@
+The minimum density of an identifying code in the king lattice.
+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 @@
+Resolvability in graphs and the metric dimension of a graph
+Normal rank
@@ Property / cites work @@
+Q3789614
@@ Property / cites work: Q3789614 / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying codes of cycles
@@ Property / cites work: Identifying codes of cycles / 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 @@
+Optimal identifying codes in cycles and paths
@@ Property / cites work: Optimal identifying codes in cycles and paths / rank @@
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Landmarks in graphs
@@ Property / cites work: Landmarks in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying codes of cycles with odd orders
@@ Property / cites work: Identifying codes of cycles with odd orders / rank @@
+Normal rank