计算机科学 ›› 2007, Vol. 34 ›› Issue (3): 246-249.

• 计算机网络与信息安全 • 上一篇    下一篇

求网的S-不变量的一种图算法

  

  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    国家自然科学基金资助课题(60173053).

  • Online:2018-11-16 Published:2018-11-16

摘要: 本文提出了一种新的求解网的S-不变量的方法。这种方法的基本思路是把一个网看作一个有向图,通过寻找网N的S-封闭基本有向贯通路簇或S-封闭基本有向回路簇,可以得到封闭重数方程组,求此封闭重数方程组的解就得到此网N的所有极小S-不变量。

关键词: S-不变量 S-封闭基本有向回路簇 S-封闭基本有向贯通路簇 封闭重数

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

Key words: S-invariant, S-closured basic directed circuit cluster, S-closured basic directed transfixion path cluster, Closure repetitive degree

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!