Location:
Search - dominating set
Search list
Description: 寻最小支配集,用DP,复杂度是2^8
比2^150次方快多了-find the smallest dominating set with the DP, complexity is 2 ^ 2 ^ than eight 150-th power much quicker
Platform: |
Size: 1403 |
Author: ziliang |
Hits:
Description: 50个节点的BA网络模型中用穷举法求支配集-50 node network model BA exhaustive method used for dominating set
Platform: |
Size: 38843 |
Author: 朱春晖 |
Hits:
Description: 寻最小支配集,用DP,复杂度是2^8
比2^150次方快多了-find the smallest dominating set with the DP, complexity is 2 ^ 2 ^ than eight 150-th power much quicker
Platform: |
Size: 1024 |
Author: ziliang |
Hits:
Description: 利用labview求最小极小控制集,可以求得一个图的最小极小控制集-Order to minimize the use of LabVIEW minimal dominating set, you can find a map of the smallest minimal dominating set
Platform: |
Size: 20480 |
Author: victor8064 |
Hits:
Description: 图论的算法书籍，书中包含许多经典的例子，入门用。
章节：1基本概念 2最短路径 3最小生成树 4图的连通性 5支配集与独立集 6网络流 7匹配 8着色 9可行遍性-Graph theory, algorithms books, the book contains many classic examples of entry to use. Chapters: a basic concept of two shortest path minimal spanning tree 4 Figure 3 connectivity of five dominating set and independent set of six matching network flow 7 of 8 coloring 9 viable over the
Platform: |
Size: 4300800 |
Author: wlx |
Hits:
Description: 基于最小生成树的最小连通支配集的一种优化算法-Based on minimum spanning tree of a minimum connected dominating set algorithm
Platform: |
Size: 1024 |
Author: 唐三 |
Hits:
Description: 利用禁忌遗传算法来求最小支配集，解决物联网的层簇模型的网络拓扑。
C语言编写，linux 开发环境-Using genetic algorithm to find taboo minimum dominating set, the layer of things to solve the cluster model of network topology. C language, linux development environment
Platform: |
Size: 6983680 |
Author: 成伟 |
Hits:
Description: 分布式最小连通支配集启发式算法Distributed Heuristic Algorithm-Distributed Heuristic Algorithm for Minimum Connected Dominating Set
Platform: |
Size: 969728 |
Author: |
Hits:
Description: 虚拟骨干网，包括佛罗里达大西洋大学的Jie Wu和Hailan Li 提出的关于连通控制集的算法，第二种算法是das等提出的从找到最小近似控制集到建立一个最小生成树的算法，最后一种算法是通过寻找MIS集获得CDS的方法。这三种算法提供了三种建立CDS集的方法，连通控制集（connected dominating set，CDS）作为层次路由协议中的虚拟主干是网络中保证其余节点能顺利通信的关键，它们承受更高的通信和计算负荷，网络的可靠性会因这些关键节点中的某个节点的失效而受影响。-Virtual backbone, including Jie Wu, Florida Atlantic University and Hailan Li on the connected dominating set algorithm, the second algorithm is das, etc. proposed the establishment of a minimum spanning tree algorithm to find the smallest approximate control set to the last onethe algorithm is obtained by finding the MIS set of CDS. Of the three algorithms, three kinds of CDS set, connected dominating sets (connected dominating the set, CDS), as a hierarchical routing protocol in the virtual backbone is the network to ensure that the remaining nodes can successfully communicate key, they are subjected to higher communication and the computational load, the reliability of the network due to the failure of these critical nodes in a node affected.
Platform: |
Size: 3449856 |
Author: |
Hits:
Description: A Neural Network Model to Minimize the Connected Dominating Set for Self-Configuration of Wireless Sensor Networks
Platform: |
Size: 776192 |
Author: alferedbin |
Hits:
Description: Distributed Construction of Connected Dominating
Set in Wireless Ad Hoc Networks
Platform: |
Size: 151552 |
Author: soap |
Hits:
Description: A combining breadth-first search (BFS) or depth-first search (DFS) with aware range to find minimum connected dominating set
A backbone in a Wireless Sensor Network (WSN) reduces the communication overhead, increases the bandwidth efficiency, decreases the overall energy consumption and thus increases network operational life.The nodes in a wireless sensor network forward data towards a sink via other nodes. The limited resources on the nodes require minimum energy to be spent in this energy consuming task. This necessitates a virtual backbone that can minimize the number of hops required to reach the sink assuming that all nodes have equal transmission range. In the wireless domain, this backbone is a minimum connected dominating set.
In this paper, I propose using breadth-first search (BFS) or depth-first search (DFS) with given range to find minimum connected dominating set.
Please visit: http://iftekharkabir1987.wordpress.com/
Platform: |
Size: 174080 |
Author: jonh |
Hits:
Description: 可以根据图中点的位置判断连接关系，然后搜寻图中的MDS（最小支配集合）-You can determine the connection between the position according to FIG midpoint, then search graph MDS (Minimum Dominating Set)
Platform: |
Size: 1024 |
Author: james |
Hits:
Description: 这是一个用matlab编写的构建网络连通支配集的程序。-Build a network connected dominating set of procedures
Platform: |
Size: 3072 |
Author: 陈帅 |
Hits:
Description: 用matlab实现的ad hoc网络连通支配集算法设计和实现-An efficient algorithm for constructing a connected dominating set in mobile
ad hoc networks
Platform: |
Size: 1204224 |
Author: 悠悠 |
Hits:
Description: Clustering wireless ad hoc networks with weakly connected dominating set.zip
Platform: |
Size: 274432 |
Author: Nima |
Hits: