Identifying path covers in graphs (Q396675): Difference between revisions

@@ Property / DOI @@
-.1016/j.jda.2013.07.006
@@ Property / DOI: 10.1016/j.jda.2013.07.006 / 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.jda.2013.07.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2070240448
@@ Property / OpenAlex ID: W2070240448 / rank @@
+Normal rank
@@ Property / cites work @@
+Watching systems in graphs: an extension of identifying codes
+Normal rank
@@ Property / cites work @@
+Induced subsets
@@ Property / cites work: Induced subsets / rank @@
+Normal rank
@@ Property / cites work @@
+Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
+Normal rank
@@ Property / cites work @@
+Structural properties of twin-free graphs
@@ Property / cites work: Structural properties of twin-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying and locating-dominating codes: NP-completeness results for directed graphs
+Normal rank
@@ Property / cites work @@
+Complexity of approximating bounded variants of optimization problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the test cover problem
+Normal rank
@@ Property / cites work @@
+Extremal graphs for the identifying code problem
@@ Property / cites work: Extremal graphs for the identifying code problem / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying Codes in Line Graphs
@@ Property / cites work: Identifying Codes in Line Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths
+Normal rank
@@ Property / cites work @@
+Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
+Normal rank
@@ Property / cites work @@
+Codes identifying sets of vertices in random networks
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / 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 / DOI @@
+.1016/J.JDA.2013.07.006
@@ Property / DOI: 10.1016/J.JDA.2013.07.006 / rank @@
+Normal rank