A linear-time algorithm for the identifying code problem on block graphs (Q2413180): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2017.10.043
+Normal rank
@@ Property / OpenAlex ID @@
+W2767202676
@@ Property / OpenAlex ID: W2767202676 / rank @@
+Normal rank
@@ Property / cites work @@
+Study of Identifying Code Polyhedra for Some Families of Split Graphs
+Normal rank
@@ Property / cites work @@
+Minimal identifying codes in trees and planar graphs with large girth
+Normal rank
@@ Property / cites work @@
+Distance-hereditary graphs
@@ Property / cites work: Distance-hereditary graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying and locating-dominating codes on chains and cycles
+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 @@
+The Complexity of the Identifying Code Problem in Restricted Graph Classes
+Normal rank
@@ Property / cites work @@
+On graphs having a \(V\setminus \{x\}\) set as an identifying code
+Normal rank
@@ Property / cites work @@
+On metric properties of certain clique graphs
@@ Property / cites work: On metric properties of certain clique graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank