A Parallel Algorithm for Finding Minimum Cutsets in Reducible Graphs |
| |
| Affiliation: | Department of Mechanical Engineering, University of California, Berkeley, CA 94720, USA |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
