Abstract
Given a hypergraph, this paper provides three algorithms for finding all its minimal cutsets, minimal link cutsets and the least cutsets. The result not only set up a new studying field on cutsets of hypergraph, but also lay a foundation of analyzing the performance of multibus systems. The algorithm for determining all the least cutsets in a hypergraph is polynomial complex and more efficient than that in [2].
Similar content being viewed by others
References
Chen Tinghuai, Kang Tai and Yao Rong, The connnectivity of hypergraph and the design of fault-tolerant Multibus,Scientia Sinica, Series A,31:5(1988), 597–610.
Yao Rong, Chen Tinghuai and Kang Tai, Fault-tolerance analysis of multibus multiprocessor system,J. of Comput. Sci. & Technol. 4:2(1989).
Chen Tinghuai, Yao Rong and Kang Tai, Reliability analysis of multibus multiprocessor system (in Chinese),ACTA Electronica Sinica,2(1988), 1–7.
U. Abel and R. Bicker, Determination of all minimal cut-sets between a vertex pair in undirected graph,IEEE Trans. Reliability, R-31:2(1982), 167–171.
J.A. Buzacott and S.K. Chang, Cutset intersections and node partitions,IEEE Trans. Reliability, R-33:5(1984), 385–389.
G.B. Jasmon and O.S. Kai, A new technique in minimal path and cutset evaluation,IEEE Trans. Reliability, R-34:2(1985), 136–142.
M.O. Ball, Computational complexity of network reliability analysis: an overview,IEEE Trans. Reliability, R-35:3(1986), 230–239.
Kai Hwang and Tian-pong Chang, Combinatorial reliability analysis of multiprocessor computers,IEEE Trans. Reliability, R-31:5(1982), 469–473.
Suresh Rai, A cutset approach to reliability evaluation in communication network,IEEE Trans. Reliability, R-31:5(1982), 428–431.
M.O. Lock and Fellow Asqc, Recent developments in computing of system reliability,IEEE Trans. Reliability, R-34:5(1985), 425–435.
Claude Berge, Graphs and Hypergraphs, North-Holland Publishing Company, 1973.
Shubai Chen, Network Graph and Applications (in Chinese), Science Press, 1984.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yao, R., Kang, T. & Chen, T. Algorithms for the determination of cutsets in a hypergraph. J. of Comput. Sci. & Technol. 5, 41–46 (1990). https://doi.org/10.1007/BF02946562
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02946562