Bottleneck domination and bottleneck independent domination on graphs
In this paper, the bottleneck dominating set problem and one of its variants, the bottleneck independent dominating set problem, are considered. Let G(V, E, W) denote a graph with n-vertex-set V and in-edge-set E, where each vertex v is associated with a real cost W(v). Given any subset V' of V, the bottleneck cost of V' is defined as max (W(x) \ x epsilon V'). The major task involves identifying a dominating set/independent dominating set of G such that their bottleneck costs are minimized. This paper first proposes an O(nlogn + m) time algorithm for solving the Bottleneck Dominating Set problem on weighted general graphs using the binary search technique. Second, an 0(n) time algorithm is designed for the problem on weighted trees. Then, we show that the situation is greatly different when the Bottleneck Independent Dominating Set problem (the BIDS problem) is considered. This paper proves that the BIDS problem is NP-hard on planar graphs and presents a linear-time optimal algorithm for the BIDS problem on weighted interval graphs.
dominating set independent dominating set bottleneck cost tree planar graph interval graph