Watching systems in graphs: an extension of identifying codes (Q2446294): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2011.04.025
@@ Property / DOI: 10.1016/j.dam.2011.04.025 / 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 / OpenAlex ID @@
+W1551710741
@@ Property / OpenAlex ID: W1551710741 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0765
@@ Property / arXiv ID: 1005.0765 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results for identifying codes in planar graphs
+Normal rank
@@ Property / cites work @@
+Maximum size of a minimum watching system and the graphs achieving the bound
+Normal rank
@@ Property / cites work @@
+Q4023377
@@ Property / cites work: Q4023377 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5615282
@@ Property / cites work: Q5615282 / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying and locating-dominating codes on chains and cycles
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Discriminating codes in bipartite graphs
@@ Property / cites work: Discriminating codes in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
+Normal rank
@@ Property / cites work @@
+Links Between Discriminating and Identifying Codes in the Binary Hamming Space
+Normal rank
@@ Property / cites work @@
+Discriminating codes in (bipartite) planar graphs
@@ Property / cites work: Discriminating codes in (bipartite) planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal cardinalities for identifying and locating-dominating codes in graphs
+Normal rank
@@ Property / cites work @@
+Codes identifying sets of vertices in random networks
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On graphs having a \(V\setminus \{x\}\) set as an identifying code
+Normal rank
@@ Property / cites work @@
+Q4474266
@@ Property / cites work: Q4474266 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
+Normal rank
@@ Property / cites work @@
+Q5429563
@@ Property / cites work: Q5429563 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Nonrandom binary superimposed codes
@@ Property / cites work: Nonrandom binary superimposed codes / rank @@
+Normal rank
@@ Property / cites work @@
+Q3517160
@@ Property / cites work: Q3517160 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474243
@@ Property / cites work: Q4474243 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing codes identifying sets of vertices
@@ Property / cites work: Constructing codes identifying sets of vertices / rank @@
+Normal rank
@@ Property / cites work @@
+On the identification of vertices using cycles
@@ Property / cites work: On the identification of vertices using cycles / rank @@
+Normal rank
@@ Property / cites work @@
+On the identification problems in products of cycles
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2011.04.025
@@ Property / DOI: 10.1016/J.DAM.2011.04.025 / rank @@
+Normal rank