This paper shows by counterexamples that the algorithms of finding maximum independent set and minimum dominating set of a graph in [1] are wrong.是什么意思_This paper shows by counterexamples that the algorithms of finding maximum independent set and minimum dominating set of a graph in [1] are wrong.在線(xiàn)翻譯_英語(yǔ)_讀音_用法_例句