ON THE DETERMINATION OF ALL TIE SETS AND MINIMAL CUT SETS BETWEEN ANY 2 NODES OF A GRAPH THROUGH PETRI NETS

被引：4

作者：

HURA, GS

机构：

来源：

MICROELECTRONICS AND RELIABILITY | 1983年 / 23卷 / 03期

关键词：

D O I：

10.1016/0026-2714(83)91174-5

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

引用

页码：471 / 475

页数：5

共 8 条

[1] CUT-SET GRAPH AND SYSTEMATIC GENERATION OF SEPARATING SETS [J].

ARIYOSHI, H .

IEEE TRANSACTIONS ON CIRCUIT THEORY, 1972, CT19 (03) :233-&

[2] ENUMERATION OF ALL MINIMAL CUT-SETS FOR A NODE PAIR IN A GRAPH [J].

ARUNKUMAR, S ;

LEE, SH .

[3]

BRIEGEL JE, 1977, IEEE T RELIAB, V26, P39

HURA, GS .

MICROELECTRONICS AND RELIABILITY, 1983, 23 (01) :157-159

HURA, GS .

MICROELECTRONICS AND RELIABILITY, 1982, 22 (03) :427-428

[6]

Mayeda W., 1972, GRAPH THEORY

MURATA, T .

PEARSON, GDM .