A PARALLEL ALGORITHM FOR FINDING MINIMUM CUTSETS IN REDUCIBLE GRAPHS

被引：0
|
作者：
DEKEL, E
HU, J
机构：
[1] Department of Computer Science, The University of Texas at Dallas, Richardson, TX
来源：
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1994年 / 20卷 / 01期
关键词：
D O I：
10.1006/jpdc.1994.1004
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a parallel algorithm for finding minimum cutsets in reducible graphs. For a reducible graph that has N nodes our algorithm runs in O(log3N) time using O(N3/log N) PEs on the EREW P-RAM model of computation. We also present a parallel heuristic for finding minimal cutsets in general graphs. © 1994 Academic Press, Inc.
引用
收藏
页码：43 / 55
页数：13
相关论文
共 50 条
12345