A linear time algorithm for optimal \(k\)-hop dominating set of a tree (Q894482): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2015.07.014
@@ Property / DOI: 10.1016/j.ipl.2015.07.014 / rank @@
-Normal rank
@@ Property / cites work @@
+A linear algorithm for the domination number of a tree
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for (             <i>k</i>             ,             <i>r</i>             )-center in planar graphs and map graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4552196
@@ Property / cites work: Q4552196 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368729
@@ Property / cites work: Q4368729 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4029974
@@ Property / cites work: Q4029974 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic aspects of the \(k\)-domination problem in graphs
+Normal rank
@@ Property / cites work @@
+<i>R</i>             -Domination in Graphs
@@ Property / cites work: <i>R</i> -Domination in Graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2015.07.014
@@ Property / DOI: 10.1016/J.IPL.2015.07.014 / rank @@
+Normal rank