| 求网的S-不变量的一种图算法 |
| |
| 引用本文： | 王丽丽,吴哲辉. 求网的S-不变量的一种图算法[J]. 计算机科学, 2007, 34(3): 246-249 |
| |
| 作者姓名： | 王丽丽 吴哲辉 |
| |
| 作者单位： | 山东科技大学信息科学与工程学院,青岛,266510;安徽理工大学数理系,淮南,232001;山东科技大学信息科学与工程学院,青岛,266510 |
| |
| 摘 要： | 本文提出了一种新的求解网的S-不变量的方法。这种方法的基本思路是把一个网看作一个有向图，通过寻找网N的S-封闭基本有向贯通路簇或S-封闭基本有向回路簇，可以得到封闭重数方程组，求此封闭重数方程组的解就得到此网N的所有极小S-不变量。
|
| 关 键 词： | S-不变量 S-封闭基本有向回路簇 S-封闭基本有向贯通路簇 封闭重数 |
A Graph Algorithm to Find S-invariant of a Net |
| |
| WANG Li-Li,WU Zhe-Hui. A Graph Algorithm to Find S-invariant of a Net[J]. Computer Science, 2007, 34(3): 246-249 |
| |
| Authors: | WANG Li-Li WU Zhe-Hui |
| |
| Affiliation: | 1College of Information Science and Engineering , Shandong University of Science and Technology, Qingdao 266510;2Department of Mathematics and Physics, Anhui University of Science and Technology, Huainan 232001 |
| |
| Abstract: | A new method to find S-invariant for a net is presented in this paper.The basic idea of this method is to regard a net as a directed graph.By searching for S-closured basic directed transfixion path clusters or S-closured basic directed circuit clusters of a net we can deserve the closured repetitive-degree equation systems,from which we can get all S-invariants of the net. |
| |
| Keywords: | S-invariant S-closured basic directed circuit cluster S-closured basic directed transfixion path cluster Closure repetitive degree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
