Note on complexity of computing the domination of binary systems
From MaRDI portal
Publication:678860
DOI10.1016/S0166-218X(96)00111-4zbMath0866.68046WikidataQ127389582 ScholiaQ127389582MaRDI QIDQ678860
A. A. Chernyak, Zhanna A. Chernyak
Publication date: 27 April 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Related Items (2)
Note on complexity of computing the domination of binary systems ⋮ Domination of cyclic monotone \((s,t)\)-graphs
Cites Work
- Note on complexity of computing the domination of binary systems
- Threshold hypergraphs
- Combinatorial-graphic method of reliability analysis of complex systems with monotone Boolean functions
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Computational Complexity of Coherent Systems and the Reliability Polynomial
- Disjoint Products and Efficient Computation of Reliability
- Domination theory and the crapo β-invariant
- The Complexity of Enumeration and Reliability Problems
- A Unified Formula for Analysis of Some Network Reliability Problems
- New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
- Directed network reliability: Domination and computing coefficients of the success‐marginal expansion
- Network reliability and the factoring theorem
This page was built for publication: Note on complexity of computing the domination of binary systems
