We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 5 Issue 1
January  1990
Turn off MathJax
Article Contents
Abstract
References
Related Articles
Yao Rong, Kang Tai, Chen Tinghuai. Algorithms for the Determination of Cutsets in a Hypergraph[J]. Journal of Computer Science and Technology, 1990, 5(1): 41-46.
Citation: Yao Rong, Kang Tai, Chen Tinghuai. Algorithms for the Determination of Cutsets in a Hypergraph[J]. Journal of Computer Science and Technology, 1990, 5(1): 41-46.
shu

Algorithms for the Determination of Cutsets in a Hypergraph

  • Chongqing University;

More Information
  • Published Date: January 09, 1990
    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].
    • FullText(HTML)
    • References (5)
  • [1]
    Chen Tinghuai, Kang Tai and Yao Rong, The connnectivity of hypergraph and the design of fiult-tolerant Multibus, Scientia Sinica, Series A,31:5(1988), 597-610.
    [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 Electronics Sinica, 2(1988),1-7.
    [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.
    [5]
    J.A.Buzacott and S.K.Chang, Cutset intersections and node partitions, IEEE Trans. Reliability,R-33:5(1984), 385-389. ……….
    • Relative Articles

  • Related Articles

    [1]Xiao-Dong Wang, Ying-Jie Wu. An Improved HEAPSORT Algorithm with n log n - 0.788928n Comparisons in the Worst Case[J]. Journal of Computer Science and Technology, 2007, 22(6): 898-903.
    [2]Minghui Jiang, Joel Gillespie. Engineering the Divide-and-Conquer Closest Pair Algorithm[J]. Journal of Computer Science and Technology, 2007, 22(4): 532-540.
    [3]JIANG Tao, LI Ming, Paul M.B. Average-Case Analysis of Algorithms Using Kolmogorov Complexity[J]. Journal of Computer Science and Technology, 2000, 15(5): 402-408.
    [4]WU Jigang, JI Yongchang, CHEN Guoliang. An Optimal Online Algorithm for Half Plane Intersection[J]. Journal of Computer Science and Technology, 2000, 15(3): 295-299.
    [5]HUANG Xiong, LI wei. On k-Positive Satisfiability Problem[J]. Journal of Computer Science and Technology, 1999, 14(4): 309-313.
    [6]Ding Wei, Gong Jian, Yu Xiao. A Traffic Partition Algorithm for Switched LANs and Its Performance Analysis[J]. Journal of Computer Science and Technology, 1998, 13(3): 261-267.
    [7]Yan Yong. An Optimal Algorithm for Solving Collision Distance Between Convex Polygons in Plane[J]. Journal of Computer Science and Technology, 1993, 8(4): 81-87.
    [8]Zheng Chongxun, Zhang Kenong. Orthogonal Algorithm of Logic Probability and Syndrome-Testable Analysis[J]. Journal of Computer Science and Technology, 1990, 5(2): 203-209.
    [9]Ye Daxing. Three Improvements on an Incremental Algorithm for Automatic Semantic Analysis[J]. Journal of Computer Science and Technology, 1989, 4(1): 67-74.
    [10]Pan Yangsheng. An Analysis of WS and PFF Algorithms[J]. Journal of Computer Science and Technology, 1987, 2(2): 145-156.
    • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (24) PDF downloads (1163) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return