On the characterization of the domination of a diameter-constrained network reliability model
DOI10.1016/J.DAM.2006.03.029zbMATH Open1105.90017OpenAlexW2079195483MaRDI QIDQ2500537FDOQ2500537
Authors: Héctor Cancela, L. Petingi 
Publication date: 17 August 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.029
Recommendations
- scientific article; zbMATH DE number 1735793
- Directed network reliability: Domination and computing coefficients of the success‐marginal expansion
- Diameter constrained reliability: complexity, distinguished topologies and asymptotic behavior
- Full complexity analysis of the diameter-constrained reliability
- Reliability of communication networks with delay constraints: computational complexity and complete topologies
Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- A Survey of Network Reliability and Domination Theory
- New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
- Approximating the weight of shallow Steiner trees
- Augmenting trees to meet biconnectivity and diameter constraints
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Title not available (Why is that?)
- Parallel concepts in graph theory
- A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- Computational Complexity of Coherent Systems and the Reliability Polynomial
- Domination theory and the crapo β-invariant
- A Unified Formula for Analysis of Some Network Reliability Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
- On computing the 2-diameter-constrained \(K\)-reliability of networks
- Oriented matroid systems
- A Survey of Network Reliability and Domination Theory
- Directed network reliability: Domination and computing coefficients of the success‐marginal expansion
- Computing diameter constrained reliability of a network with junction points
This page was built for publication: On the characterization of the domination of a diameter-constrained network reliability model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500537)
