A polyhedral approach to locating-dominating sets in graphs (Q324734): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2015.07.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2203809600
@@ Property / OpenAlex ID: W2203809600 / 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 @@
+Q3789614
@@ Property / cites work: Q3789614 / rank @@
+Normal rank
@@ Property / cites work @@
+Locating and total dominating sets in trees
@@ Property / cites work: Locating and total dominating sets in trees / rank @@
+Normal rank
@@ Property / cites work @@
+On the facial structure of the set covering polytope
+Normal rank
@@ Property / cites work @@
+Domination and location in acyclic graphs
@@ Property / cites work: Domination and location in acyclic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3803159
@@ Property / cites work: Q3803159 / rank @@
+Normal rank