Total domination in interval graphs
Information Processing Letters
Total domination in interval graphs
Information Processing Letters
Total domination in interval graphs revisited
Information Processing Letters
Finding a maximum independent set in a permutation graph
Information Processing Letters
The weighted perfect domination problem
Information Processing Letters
On approximating the minimum independent dominating set
Information Processing Letters
Domination in convex and chordal bipartite graphs
Information Processing Letters
Single step searching in weighted block graphs
Information Sciences—Informatics and Computer Science: An International Journal
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Power domination in block graphs
Theoretical Computer Science
On the k-tuple domination of generalized de Brujin and Kautz digraphs
Information Sciences: an International Journal
On rainbow domination numbers of graphs
Information Sciences: an International Journal
| Hi-index | 0.00 |
Let G(V,E,W) denote a graph with vertex-set V and edge-set E, and each vertex v is associated with a cost W(v). For any set V' ⊆ V, the bottleneck cost of V' is defined as max{W(x)|x ∈ V'}. This paper considers the bottleneck independent dominating set problem (the BIDS problem) which determines an independent dominating set of G such that its bottleneck cost is minimized.This paper studies the problem on the classes of bipartite graphs and block graphs. This paper first proves that the problem is NP-hard on chordal-bipartite graphs. Second, a linear-time algorithm on convex-bipartite graphs is proposed. Next, a linear-time algorithm on trees is designed. Then, we generalize the algorithmic result to block graphs. All algorithms are designed by the dynamic programming strategy.