View of Computation of minimum $d$-hop connected dominating set of trees in $O(n)$ time

Return to Article Details Computation of minimum $d$-hop connected dominating set of trees in $O(n)$ time Download Download PDF