Algorithms for the determination of cutsets in a hypergraph
From MaRDI portal
Publication:805260
DOI10.1007/BF02946562zbMATH Open0728.68092MaRDI QIDQ805260FDOQ805260
Authors: Rong Yao, Tai Kang, Tinghuai Chen 
Publication date: 1990
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Recommendations
- Computing minimum cuts in hypergraphs
- scientific article; zbMATH DE number 4091549
- scientific article; zbMATH DE number 1234600
- A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
- Hypergraph \(k\)-cut in randomized polynomial time
- scientific article; zbMATH DE number 6850403
- Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
- A Heuristic Solution of a Cutting Problem Using Hypergraphs
- Minimum cuts and sparsification in hypergraphs
- scientific article; zbMATH DE number 3999696
Cites Work
- Computational Complexity of Network Reliability Analysis: An Overview
- 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
- Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph
- A Cutset Approach to Reliability Evaluation in Communication Networks
Cited In (10)
- Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs.
- Title not available (Why is that?)
- A Heuristic Solution of a Cutting Problem Using Hypergraphs
- On minimal cuts of recursively generated hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hypergraph Cuts with General Splitting Functions
- LS sets as cohesive subsets of graphs and hypergraphs
- Title not available (Why is that?)
- Finding and using directed cuts of real graphs of algorithms
This page was built for publication: Algorithms for the determination of cutsets in a hypergraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805260)
