Complexity of finding k-path-free dominating sets in graphs (Q1167535): Difference between revisions

@@ Property / author @@
-Reuven Bar Yehuda
@@ Property / author: Reuven Bar Yehuda / rank @@
-Normal rank
@@ Property / author @@
-Uzi Vishkin
@@ Property / author: Uzi Vishkin / rank @@
-Normal rank
@@ Property / author @@
+Reuven Bar Yehuda
@@ Property / author: Reuven Bar Yehuda / rank @@
+Normal rank
@@ Property / author @@
+Uzi Vishkin
@@ Property / author: Uzi Vishkin / 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/0020-0190(82)90021-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2089836190
@@ Property / OpenAlex ID: W2089836190 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4050630
@@ Property / cites work: Q4050630 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4065548
@@ Property / cites work: Q4065548 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5672651
@@ Property / cites work: Q5672651 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3883524
@@ Property / cites work: Q3883524 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5581642
@@ Property / cites work: Q5581642 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585195
@@ Property / cites work: Q5585195 / rank @@
+Normal rank
@@ Property / cites work @@
+Problems and methods with multiple objective functions
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1167535