您要查找的是不是：
- Total dominating set 全控制集
- In this paper, we study the total efficient dominating set of a digraph. 本文研究有向图的全有效控制集。
- It is difficult to ascertain an efficient dominating set of a graph. 通常要判断一个图是否存在有效控制集是困难的。
- A Novel Distributed Approximation Algorithm for Minimum Connected Dominating Set. 一个新的分布式最小连通支配集近似算法。
- A dominating set D of a graph G is defined as a subset of vertices in G such that each vertex not in D is adjacent to at least one vertex of D. 图的控制集定义为图中的一个点的集合，使得图中其它任何一个点与该点集中的某个点邻接。
- This paper shows by counterexamples that the algorithms of finding maximum independent set and minimum dominating set of a graph in [1] are wrong. 用反例证明了文[1]中的最大独立集算法和最小支配集算法的结论都是错误的，因而图论中独立支配集的求解问题并没有解决.
- However, the executive does not enjoy total domination. 但是执政者并非享有绝对的控制。
- 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. 基于连通支配集算法的虚拟主干网技术对于无线自组网的路由优化、能量保护和资源分配都具有重要的作用。
- Perfect dominating set and efficient dominating set are two special kinds of dominating sets of graphs. 摘要图的完美控制集和有效控制集是两类特殊的控制集。
- Nearly total domination of the Japanese market is ruled by a few dozens giant conglomerates. 几乎所有的日本市场均被几十家庞大的联合大企业所统治。
- reverse signed edge total dominating function 反符号边全控制函数
- 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难问题，许多近似算法被提出用于构建可用的最小连通支配集。
- signed total dominating function 符号全控制函数
- 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完全问题。
- Cockayne and Mynhardt is motivated by the belief that the study of total irredundance will shed light on the concept of total domination. Cockayne和Mynhardt更是认为对全无赘数的讨论有利于我们更好的了解全控制数。
- This paper shows that undirected circulant graphs must contain efficient dominating sets. 该文证明了无向循环图一定存在有效控制集。
- The mass rally was a total fiasco. 那次群众集会彻底失败。
- Energy-Efficient Minimum Connected Dominating Set 能量有效的最小连通支配集近似算法
