您要查找的是不是：
- A Novel Distributed Approximation Algorithm for Minimum Connected Dominating Set. 一个新的分布式最小连通支配集近似算法。
- The final formed scatternet is connected, and master and bridge nodes constitute a connected dominating set of scatternets. 任意两个相邻匹克网之间通过惟一的连接路由互连，最终形成一个连通的散射网，主和桥节点构成散射网的一个连通支配集。
- Connected dominating set based virtual backbone played a key role in a wireless ad hoc network for routing optimization,energy conservation and resource allocation. 基于连通支配集算法的虚拟主干网技术对于无线自组网的路由优化、能量保护和资源分配都具有重要的作用。
- 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难问题，许多近似算法被提出用于构建可用的最小连通支配集。
- To avoid a large volume of unnecessary network traffic, the broadcast algorithm based on connected dominating set (BCDS) can decrease the redundant messages by reducing the forwarding nodes. 摘要为了避免由洪泛搜索方法引起的大量网络流量问题，基于连通支配集的广播算法BCDS通过减少转发节点来减少查询消息数。
- Minimizing retransmission nodes in broadcasting is equivalent to minimizing connected dominating set in graph theory,and finding a minimum connected dominating set is NP-complete for graphs. 广播过程中最小化参与转发节点数问题与图论中求解最小连通支配集问题等价,而在任意图中求解最小连通支配集是NP完全问题。
- Energy-Efficient Minimum Connected Dominating Set 能量有效的最小连通支配集近似算法
- minimum connected dominating set 最小连通支配集
- mlnlmum connected dominating set 极小连通支配集
- Distributed Construction for Power Aware Connected Dominating Set 能量限制的连通支配集分布式构造
- minimum connected dominating sets 最小连通支配集
- A Heuristic Algorithm for Minimum Connected Dominating Set with Maximal Weight in Ad Hoc Networks 基于极大权的最小连通支配集启发式算法
- Graph coloring based minimal connected dominating set algorithm in wireless ad hoc networks 基于图着色的无线自组网极小连通支配集算法
- Keywords MPLS;Topology Aggregation;Minimum Weighted Dominating Set;Connected Dominating Set;Hierarchical Multicast;Label Stack;Hi-speed Broadband Router; 多协议标签交换;拓扑聚合;加权最小支配集;连通支配集;层次组播;标签堆栈;高速宽带路由器;
- Connected Dominating Set (CDS) 连通支配集
- A Power and Load-Aware Algorithm for Constructing Minimal Connected Dominating Sets in Mobile Ad-Hoc Networks 移动自组网电力及负荷感知的构造最小连通支配集算法
- connected dominating set 连通支配集
- It is difficult to ascertain an efficient dominating set of a graph. 通常要判断一个图是否存在有效控制集是困难的。
- In this paper, we study the total efficient dominating set of a digraph. 本文研究有向图的全有效控制集。
- connected dominating sets 连通支配集
