Although finding the Minimum Connected Dominating Set (MCDS) in an arbitrary graph is a NP-bard problem, many approximation algorithms have been proposed to construct a serviceable CDS.
英
美
释义
由于求解最小连通支配集是一个NP难问题,许多近似算法被提出用于构建可用的最小连通支配集。
把海词放在桌面上,查词最方便
触屏版
|
电脑版
©2003 - 2024 海词词典(Dict.cn)
立即下载