1) MWMCDS
极大权最小连通支配集
2) 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。
3) 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.
通过引入极大独立集和极小支配集概念,基于图着色思想提出一种新的适合于无线自组网的极小连通支配集算法,从理论上证明了该算法的正确性和高效性,也通过仿真实验分析了该算法在多种情况下的实际性能,仿真结果表明新算法在簇头和主干节点数目方面具有较好的性能,特别在节点密集的网络环境中更加突出。
4) Minimum Weighted Dominating Set
加权最小支配集
5) energy-efficient minimum connected dominating set
能量有效最小连通支配集
6) 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;
大规模灾害条件下基于连通支配集的重路由方案
补充资料：大权
【大权】
（术语）言佛菩萨之大圣权。化现异形也。法华玄义六曰：“摩耶是千佛之母，净饭是千佛之父，罗睺罗千佛之子。诸声闻等悉内秘外现，示众有三毒实自净佛土，诸亲族等皆是大权法身上地，岂有凡夫能怀那罗延菩萨耶？”
（术语）言佛菩萨之大圣权。化现异形也。法华玄义六曰：“摩耶是千佛之母，净饭是千佛之父，罗睺罗千佛之子。诸声闻等悉内秘外现，示众有三毒实自净佛土，诸亲族等皆是大权法身上地，岂有凡夫能怀那罗延菩萨耶？”
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条