Reliability covering problems for hypergraphs

DOI10.1007/BF02667919zbMath0949.05057OpenAlexW2086673967MaRDI QIDQ1968515

A. A. Chernyak

Publication date: 29 November 2000

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02667919

zbMATH Keywords

multigraphhypergraphNP-completereliability polynomialreliability covering

Mathematics Subject Classification ID

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

Cites Work

• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• On graphs with randomly deleted edges
• Reliability covering problems
• Calculating K-Connectedness Reliability Using Steiner Bounds
• Reliability of binary systems
• Network transformations and bounding network reliability

This page was built for publication: Reliability covering problems for hypergraphs