Algorithms for the determination of cutsets in a hypergraph

DOI10.1007/BF02946562zbMath0728.68092MaRDI QIDQ805260

Tinghuai Chen, Tai Kang, Rong Yao

Publication date: 1990

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

zbMATH Keywords

hypergraphnetwork problemminimal cutsetspolynomial complex

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Fault-tolerance analysis of multibus multiprocessor system
• A New Technique in Minimal Path and Cutset Evaluation
• Recent Developments in Computing of System-Reliability
• Cut-Set Intersections and Node Partitions
• Computational Complexity of Network Reliability Analysis: An Overview
• Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph
• A Cutset Approach to Reliability Evaluation in Communication Networks

This page was built for publication: Algorithms for the determination of cutsets in a hypergraph