| 超图的最短路径算法 |
| |
| 引用本文： | 龚劬,程绩.超图的最短路径算法[J].重庆大学学报(自然科学版),2005,28(11):106-109. |
| |
| 作者姓名： | 龚劬 程绩 |
| |
| 作者单位： | 重庆大学,数理学院,重庆,400030;重庆大学,数理学院,重庆,400030 |
| |
| 摘 要： | 从超图的强同构引出保持超图顶点间超邻接性的点同构,定义超图的邻接矩阵和赋权超图的权矩阵,并在此基础上得到了求解超图任意顶点间最短路径和求解超图直径的推广Floyd算法.最后通过实例验证了算法的可行性,并与李春明在1994年得到的结果进行比较,得出算法的复杂度为O(n3),该算法是一个有效算法.
|
| 关 键 词： | 超图 点同构 邻接矩阵 Floyd算法 |
| 文章编号： | 1000-582X（2005）11-0106-04 |
| 收稿时间： | 2005-06-23 |
| 修稿时间： | 2005年6月23日 |
Shortest Path Algorithm for Hypergraphs |
| |
| GONG Qu,CHENG Ji.Shortest Path Algorithm for Hypergraphs[J].Journal of Chongqing University(Natural Science Edition),2005,28(11):106-109. |
| |
| Authors: | GONG Qu CHENG Ji |
| |
| Institution: | College of Mathematics and Physics, Chongqing University, Chongqing 400030, China |
| |
| Abstract: | Based on strong isomorphism for hypergraphs,vertex isomorphism is defined,which preserves hyper-adjacency property between vertices.Adjacency-matrixes of hypergraphs and weighted hypergraphs are presented respectively.The Floyd's algorithm is generalized to finding shortest paths between all pairs of vertices in a hypergraph.The publication provides an instance which verifies the practicability of the modified algorithm and whose results have been compared with those of the method given by LI Chun-ming.Time complexity of the presented algorithm is obtained to be(O(n~3)). |
| |
| Keywords: | hypergraph vertex isomorphism adjacency matrix Floyd's algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《重庆大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《重庆大学学报(自然科学版)》下载免费的PDF全文 |
