| 混合图的同构判定算法:度序列法 |
| |
| 引用本文： | 臧威,李锋. 混合图的同构判定算法:度序列法[J]. 计算机应用与软件, 2008, 25(3): 198-200 |
| |
| 作者姓名： | 臧威 李锋 |
| |
| 作者单位： | 复旦大学电子工程系,上海,200433 |
| |
| 摘 要： | 提出了新的混合图的同构判定算法.该算法通过考察图的n点连通子图的度序列对混合图进行同构判定,适合计算机并行处理.实验表明这种方法在多数情况下快捷有效.
|
| 关 键 词： | 混合图 同构判定 度序列 |
| 收稿时间： | 2006-07-06 |
| 修稿时间： | 2006-07-06 |
ISOMORPHISM TESTING ALGORITHM FOR MIXED GRAPHS:THE DEGREE SEQUENCE METHOD |
| |
| Zang Wei,Li Feng. ISOMORPHISM TESTING ALGORITHM FOR MIXED GRAPHS:THE DEGREE SEQUENCE METHOD[J]. Computer Applications and Software, 2008, 25(3): 198-200 |
| |
| Authors: | Zang Wei Li Feng |
| |
| Affiliation: | Zang Wei Li Feng(Department of Electronic Engineering,Fudan University,Shanghai 200433,China) |
| |
| Abstract: | A new isomorphism-testing algorithm for mixed graphs is proposed. The method determines isomorphism by degree sequences of the n-vertex connected sub-graphs. The algorithm is suitable for parallel implementation on computers. Experiments show that it is efficient and effective in most cases. |
| |
| Keywords: | Mixed graphs Isomorphism testing Degree sequence |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
