A PETRI NET APPROACH TO ENUMERATING ALL CIRCUITS OF A GRAPH

被引：5

作者：

HURA, GS

机构：

来源：

MICROELECTRONICS AND RELIABILITY | 1984年 / 24卷 / 03期

关键词：

D O I：

10.1016/0026-2714(84)90460-8

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

引用

页码：387 / 389

页数：3

共 10 条

[1]

CHAR JP, 1965, P IEEE, P115

[2] ON FINDING SIMPLE PATHS AND CIRCUITS IN A GRAPH [J].

DANIELSON, GH .

IEEE TRANSACTIONS ON CIRCUIT THEORY, 1968, CT15 (03) :294-+

[3]

DEV N, 1974, GRAPH THEORY APPLICA

HURA, GS .

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

[5] ENUMERATION OF ALL 2-TREES IN A GRAPH THROUGH PETRI NETS [J].

HURA, GS .

MICROELECTRONICS AND RELIABILITY, 1983, 23 (05) :851-853

HURA, GS .

MICROELECTRONICS AND RELIABILITY, 1983, 23 (03) :471-475

[7]

MAXWELL LM, 1965, 8TH MIDW S CIRC THEO

MURATA, T .

[9]

POSTEIN J, 1966, J SIAM, P600

[10]

RAO VVB, 1969, P IEEE, P700