Calculating the minimum Connected Dominating Sets has been proven to be a NP complete problem, so heuristic method is often used to calculate approximatively the optimal solution as the most common means.

  • 最小连通支配集的求取已经被证明是NP完全问题,现在最通用的手段是通过启发式的方法求得最优解。

  • 互联网摘选 2025-01-19 23:26:22

    • 相关例句
    精确
    • 模糊
    • 词首
    • 词尾
    • 词义
    • 例句