首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于DPCNN的无向赋权图的最小生成树的求解
引用本文:杨丽云,周冬明,赵东风,张绍堂.基于DPCNN的无向赋权图的最小生成树的求解[J].云南大学学报(自然科学版),2008,30(2):142-147.
作者姓名:杨丽云  周冬明  赵东风  张绍堂
作者单位:云南大学,信息学院通信工程系,云南,昆明,650091
基金项目:云南省自然科学基金 , 云南大学重点项目
摘    要: 利用脉冲耦合神经网络(PCNN,Pulse Coupled Neural Network)的脉冲波并行传播特性,在其时延脉冲耦合神经网络(DPCNN,Delay PCNN)的基础上提出了一种求解无向赋权图最小生成树的新算法.算法针对最小生成树的权值总和最小且连通的性质,结合时延脉冲耦合神经网络脉冲波的并行传播,通过求解无向赋权图的最短路径并对其连通性进行判断,采用迭代的方法,成功地求解了无向赋权图的最小生成树.最后给出了仿真实验,证明了该方法的有效性,与传统算法比较有一定的优势.

关 键 词:时延脉冲耦合神经网络(DPCNN)  最小生成树  无向赋权图
文章编号:0258-7971(2008)02-0142-06
收稿时间:2007-09-11
修稿时间:2007年9月11日

The solution-based DPCNN to the minimum spanning tree of undirected weighted graph
YANG Li-yun,ZHOU Dong-ming,ZHAO Dong-feng,ZHANGN Shao-tang.The solution-based DPCNN to the minimum spanning tree of undirected weighted graph[J].Journal of Yunnan University(Natural Sciences),2008,30(2):142-147.
Authors:YANG Li-yun  ZHOU Dong-ming  ZHAO Dong-feng  ZHANGN Shao-tang
Institution:Department of Communication Engineering, School of Information, Yunnan University, Kunming 650091, China
Abstract:It is presented a new algorithm to find the minimum spanning tree on the basis of the pulse parallel transmission characteristic of DPCNN(Delay Pulse Coupled Neural Network).According to the character of the minimum spanning tree,the minimal weight summation and connectivity,algorithm combines DPCNN together and finds the shortest path of undirected weighted graph,then judges the connectivity.By the iterative method,this algorithm can be used to find the minimum spanning tree of undirected weighted graph.Finally,it is given the simulation experiment to show its availability.Therefore,it is clear that it is more advantageous than the traditional ways.
Keywords:delay pulse coupled neural network  minimum spanning tree  undirected weighted graph
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《云南大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《云南大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号