GENERATION OF DIRECTED CIRCUITS IN A DIRECTED GRAPH

被引：2

作者：

SRIMANI, PK

机构：

[1] Electronics Unit, Indian Statistical Institute, Calcutta-700035

来源：

PROCEEDINGS OF THE IEEE | 1979年 / 67卷 / 09期

关键词：

D O I：

10.1109/PROC.1979.11455

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

A new matrix algorithm has been presented to generate all directed circuits in a given directed graph. The method is based on multiplication of the modified adjacency matrix of the graph by itself according to some modified rules of matrix multiplication. © 1979 IEEE.

引用

页码：1361 / 1362

页数：2

共 8 条

[1]

DEO N, 1974, GRAPH THEORY APPLICA

[2]

GLEASON TC, 1966, PSYCHOMETRICA, V31, P179

[3]

HARARY F, 1965, STRUCTURAL MODELS IN

[4] REVISED MATRIX ALGORITHMS FOR SHORTEST PATHS [J].

HU, TC .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1967, 15 (01) :207-&

[5]

Johnson D. B., 1975, SIAM Journal on Computing, V4, P77, DOI 10.1137/0204007

[6] A SYSTEMATIC METHOD OF FINDING ALL DIRECTED CIRCUITS AND ENUMERATING ALL DIRECTED PATHS [J].

KAMAE, T .

IEEE TRANSACTIONS ON CIRCUIT THEORY, 1967, CT14 (02) :166-&

[7]

Mateti P., 1976, SIAM Journal on Computing, V5, P90, DOI 10.1137/0205007

[8] GENERATION OF ALL HAMILTONIAN CIRCUITS PATHS AND CENTERS OF A GRAPH AND RELATED PROBLEMS [J].

YAU, SS .

IEEE TRANSACTIONS ON CIRCUIT THEORY, 1967, CT14 (01) :79-&

← 1 →