Skip to main content
Log in

Algorithms for the determination of cutsets in a hypergraph

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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].

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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.

    MathSciNet  Google Scholar 

  2. Yao Rong, Chen Tinghuai and Kang Tai, Fault-tolerance analysis of multibus multiprocessor system,J. of Comput. Sci. & Technol. 4:2(1989).

  3. Chen Tinghuai, Yao Rong and Kang Tai, Reliability analysis of multibus multiprocessor system (in Chinese),ACTA Electronica Sinica,2(1988), 1–7.

    Google Scholar 

  4. 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.

    MATH  Google Scholar 

  5. J.A. Buzacott and S.K. Chang, Cutset intersections and node partitions,IEEE Trans. Reliability, R-33:5(1984), 385–389.

    MATH  Google Scholar 

  6. 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.

    MATH  Google Scholar 

  7. M.O. Ball, Computational complexity of network reliability analysis: an overview,IEEE Trans. Reliability, R-35:3(1986), 230–239.

    Article  MATH  Google Scholar 

  8. Kai Hwang and Tian-pong Chang, Combinatorial reliability analysis of multiprocessor computers,IEEE Trans. Reliability, R-31:5(1982), 469–473.

    Article  Google Scholar 

  9. Suresh Rai, A cutset approach to reliability evaluation in communication network,IEEE Trans. Reliability, R-31:5(1982), 428–431.

    MATH  MathSciNet  Google Scholar 

  10. M.O. Lock and Fellow Asqc, Recent developments in computing of system reliability,IEEE Trans. Reliability, R-34:5(1985), 425–435.

    Google Scholar 

  11. Claude Berge, Graphs and Hypergraphs, North-Holland Publishing Company, 1973.

  12. Shubai Chen, Network Graph and Applications (in Chinese), Science Press, 1984.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02946562

Keywords

Navigation