LINEAR TIME ALGORITHM FOR FINDING MINIMUM CUTSETS IN REDUCIBLE GRAPHS

被引：51

|

作者：

SHAMIR, A

机构：

来源：

SIAM JOURNAL ON COMPUTING | 1979年 / 8卷 / 04期

关键词：

D O I：

10.1137/0208051

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：645 / 655

页数：11

相关论文

共 50 条

[1] 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
[2] FINDING A MINIMUM FEEDBACK ARC SET IN REDUCIBLE FLOW-GRAPHS
RAMACHANDRAN, V
[J]. JOURNAL OF ALGORITHMS, 1988, 9 (03) : 299 - 313
[3] A LINEAR-TIME RECOGNITION ALGORITHM FOR P-4-REDUCIBLE GRAPHS
JAMISON, B
OLARIU, S
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 405 : 1 - 19
[4] A LINEAR-TIME RECOGNITION ALGORITHM FOR P-4-REDUCIBLE GRAPHS
JAMISON, B
OLARIU, S
[J]. THEORETICAL COMPUTER SCIENCE, 1995, 145 (1-2) : 329 - 344
[5] A LINEAR-TIME RECOGNITION ALGORITHM FOR P-4-REDUCIBLE GRAPHS
JAMISON, B
OLARIU, S
[J]. FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE ////, 1989, 405 : 1 - 19
[6] A LINEAR-TIME ALGORITHM FOR FINDING A MINIMUM SPANNING PSEUDOFOREST
GABOW, HN
TARJAN, RE
[J]. INFORMATION PROCESSING LETTERS, 1988, 27 (05) : 259 - 263
[7] An optimal time algorithm for minimum linear arrangement of chord graphs
Raoufi, Pariya
Rostami, Habib
Bagherinezhad, Hessam
[J]. INFORMATION SCIENCES, 2013, 238 : 212 - 220
[8] An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three
Frieze, Alan
Haber, Simi
[J]. RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (01) : 73 - 98
[9] A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Outerplanar Graphs
Nakayama, Shin-ichi
Masuyama, Shigeru
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2017, E100D (03) : 434 - 443
[10] An efficient algorithm for finding maximum cycle packings in reducible flow graphs
Chen, XJ
Zang, W
[J]. ALGORITHMS AND COMPUTATION, 2004, 3341 : 306 - 317

← 1 2 3 4 5 →