图论中独立支配集的求解问题并未解决

The Problem of Solving the Independent-Dominating Set of a Graph is Open

中文关键词:  图论  独立集  支配集  算法

英文关键词:graph theory  independent set  dominating set  algorithm

中文摘要:

      用反例证明了文[1]中的最大独立集算法和最小支配集算法的结论都是错误的，因而图论中独立支配集的求解问题并没有解决．

英文摘要:

      This paper shows by counterexamples that the algorithms of finding maximum independent set and minimum dominating set of a graph in [1] are wrong.