Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

AN ALGORITHM FOR GENERATING MINIMAL CUTSETS OF UNDIRECTED GRAPHS

  • Published : 1998.09.01

⟨ Previous Next ⟩

Abstract

In this paper we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutest ex-actly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets at O(e.n) {where e,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented.

Keywords

References

  1. IEEE Trans. Reliability v.R-31 Determination of all minimal cutsets between a vertex pair in an undirected graph U.Abel;R.Bicker
  2. IEEE Trans. Reliability v.R-34 A new technique in minimal path and cutset evaluation G.B.Jasmon;O.S.Kai
  3. IEEE Trans. Reliability v.R-34 Recent Developments in Computing of System-Reliability M.O.Locks
  4. Graph Theory W.Mayeda
  5. IEEE Trans. Reliability v.44 Vertex Cutsets of Undirected Graphs C.Patvardhan;V.C.Prasad;V.Prem Pyara
  6. Microelectron. Reliab. v.32 Generation of vertex and edge cutsets V.C.Prasad;V.Sankar;K.S.Prakasa Rao
  7. IEEE Trans. Reliability v.R-34 Algorithms for Generating Minimal Cutsets by Inversion D.R.Shier;D.E.Whited