ON AN ALGORITHM TO ENUMERATE ALL THE CUTSETS IN A GRAPH

被引：0

|

作者：

TSUKIYAMA, S

SHIRAKAWA, I

OZAKI, H

机构：

来源：

ELECTRONICS & COMMUNICATIONS IN JAPAN | 1978年 / 61卷 / 07期

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

引用

收藏

页码：9 / 15

页数：7

相关论文

共 50 条

[21] GENERATION OF ALL CUTSETS OF A BIPATH NETWORK
TOIDA, S
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1973, CO21 (12) : 1414 - 1417
[22] CONNECTED CUTSETS OF A GRAPH AND TRIANGLE BASES OF THE CYCLE SPACE
DUCHET, P
VERGNAS, ML
MEYNIEL, H
[J]. DISCRETE MATHEMATICS, 1986, 62 (02) : 145 - 154
[23] SIMPLE ENUMERATION OF MINIMAL CUTSETS OF ACYCLIC DIRECTED GRAPH
AHMAD, SH
[J]. IEEE TRANSACTIONS ON RELIABILITY, 1988, 37 (05) : 484 - 487
[24] A Time and Memory Efficient Way to Enumerate Cycles in a Graph
Sankar, K.
Sarad, A., V
[J]. ICIAS 2007: INTERNATIONAL CONFERENCE ON INTELLIGENT & ADVANCED SYSTEMS, VOLS 1-3, PROCEEDINGS, 2007, : 498 - 500
[25] AN ALGORITHM FOR EVALUATING ALL THE MINIMAL CUTS OF A GRAPH
SINGH, B
[J]. MICROELECTRONICS AND RELIABILITY, 1995, 35 (05): : 865 - 867
[26] A SIMPLE ALGORITHM FOR LISTING ALL TREES OF A GRAPH
MINTY, GJ
[J]. IEEE TRANSACTIONS ON CIRCUIT THEORY, 1965, CT12 (01): : 120 - &
[27] A CONTRACTION ALGORITHM FOR FINDING SMALL CYCLE CUTSETS
LEVY, H
LOW, DW
[J]. JOURNAL OF ALGORITHMS, 1988, 9 (04) : 470 - 493
[28] Orderly Algorithm to Enumerate Central Groupoids and Their Graphs
Tim BOYKETT
[J]. Acta Mathematica Sinica,English Series, 2007, 23 (02) : 249 - 264
[29] An algorithm for generating minimal cutsets of undirected graphs
Yong Yeon Shin
Jai Sang Koh
[J]. Korean Journal of Computational & Applied Mathematics, 1998, 5 (3) : 681 - 693
[30] Orderly Algorithm to Enumerate Central Groupoids and Their Graphs
Tim Boykett
[J]. Acta Mathematica Sinica, English Series, 2007, 23 : 249 - 264

← 1 2 3 4 5 →