说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 2-连通k-支配集
1)  2-connected k-dominating set
2-连通k-支配集
1.
Fault-tolerant virtual backbones were modeled as 2-connected k-dominating sets.
利用2-连通k-支配集作为容错虚拟主干网的模型。
2)  connected dominating set
连通支配集
1.
Efficient algorithm for finding minimum connected dominating set in wireless sensor networks;
传感器网络中高效的最小连通支配集求解算法
2.
An algorithm for constructing efficient connected dominating sets in wireless sensor networks;
一种在无线传感器网络中构造有效连通支配集的算法
3.
A rerouting scheme using connected dominating set in large-scale disaster scenario;
大规模灾害条件下基于连通支配集的重路由方案
3)  minimum connected dominating set
最小连通支配集
1.
Finding a minimum connected dominating set for a network graph is of great importance in practical applications.
寻找出一个网络图的最小连通支配集有重要实际应用背景,然而如何找到它却是一个NP难题。
2.
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完全问题。
3.
For the NP-hard problem of constructing minimum connected dominating set(MCDS) in Ad hoc networks,this paper proposed a novel distributed MCDS constructing algorithm called DMCA.
针对无线自组织分组(Ad hoc)网络中最小连通支配集(MCDS)创建NP难问题,提出了一种分布式的最小连通集创建算法DMCA。
4)  minimum connected dominating set
极小连通支配集
1.
Using the concept of minimum dominating set,maximum in-dependent set,new graph coloring theory based minimum connected dominating set algorithm was proposed to construct virtual backbone in wireless ad hoc networks.
通过引入极大独立集和极小支配集概念,基于图着色思想提出一种新的适合于无线自组网的极小连通支配集算法,从理论上证明了该算法的正确性和高效性,也通过仿真实验分析了该算法在多种情况下的实际性能,仿真结果表明新算法在簇头和主干节点数目方面具有较好的性能,特别在节点密集的网络环境中更加突出。
5)  MWMCDS
极大权最小连通支配集
6)  k-restricted component
k限制连通分支
1.
This paper discusses the problem of minimizing the number of k-restricted components:Given a graph G=(V, E), a weight functionωon V and an integer k, partition V into disjoint subsets{V1, V2,…Vj}.
本文所讨论图划分问题为最小化k限制连通分支数问题:对于任意连通图G=(V,E),给定V上的权重函数ω,对任意整数k,将V划分为尽可能少的互不相交的顶点集{V1,V2,…Vj},使得所有Vi在原图中的诱导子图为连通图,并且权重ω(Vi)≤k。
补充资料:支配
①调度;安排:我的时间不够支配|我们这些人都是听你支配的。②起控制或引导的作用:思想支配着行动。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条