The problem of determining a minimum independent dominating set is fundamental to both the theory and applications of graphs. Computationally it belongs to the class of hard combinatorial optimization problems known a...
详细信息
The problem of determining a minimum independent dominating set is fundamental to both the theory and applications of graphs. Computationally it belongs to the class of hard combinatorial optimization problems known a...
详细信息
The problem of determining a minimum independent dominating set is fundamental to both the theory and applications of graphs. Computationally it belongs to the class of hard combinatorial optimization problems known as NP-hard. In this paper, we develop a backtracking algorithm and a dynamic programming algorithm to determine a minimum independent dominating set. Computational experience with the backtracking algorithm on more than 1000 randomly generated graphs ranging from 100 to 200 vertices and from 10% to 60% densities has shown that the algorithm is effective.
暂无评论