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 条

[41] A competitive algorithm to find all defective edges in a graph
Hwang, FK
[J]. DISCRETE APPLIED MATHEMATICS, 2005, 148 (03) : 273 - 277
[42] Algorithms for the minimal cutsets enumeration of networks by graph search and branch addition
Suh, H
Chang, CK
[J]. 25TH ANNUAL IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS - PROCEEDINGS, 2000, : 100 - 107
[43] A PARALLEL ALGORITHM FOR FINDING MINIMUM CUTSETS IN REDUCIBLE GRAPHS
DEKEL, E
HU, J
[J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1994, 20 (01) : 43 - 55
[44] Fast Algorithms to Enumerate All Common Intervals of Two Permutations
T. Uno
M. Yagiura
[J]. Algorithmica, 2000, 26 : 290 - 309
[45] A parallel algorithm for finding all hinge vertices of an interval graph
Honma, H
Masuyama, S
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2001, E84D (03) : 419 - 423
[46] An algorithm for enumerating all directed spanning trees in a directed graph
Uno, T
[J]. ALGORITHMS AND COMPUTATION, 1996, 1178 : 166 - 173
[47] AN ALGORITHM TO FIND ALL PATHS BETWEEN 2 NODES IN A GRAPH
MIGLIORE, M
MARTORANA, V
SCIORTINO, F
[J]. JOURNAL OF COMPUTATIONAL PHYSICS, 1990, 87 (01) : 231 - 236
[48] A parallel algorithm for finding all hinge vertices of a trapezoid graph
Honma, H
Masuyama, S
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2002, E85A (05) : 1031 - 1040
[49] A Parallel Algorithm for Finding All Elementary Circuits of a Directed Graph
Lu, Wenbo
Zhao, Qianchuan
Zhou, Cangqi
[J]. 2018 37TH CHINESE CONTROL CONFERENCE (CCC), 2018, : 3156 - 3161
[50] A parallel algorithm for finding all hinge vertices of an interval graph
[J]. Honma, H., 2001, Institute of Electronics, Information and Communication, Engineers, IEICE (E84-D)

← 1 2 3 4 5 →