On the characterization of the domination of a diameter-constrained network reliability model

DOI10.1016/J.DAM.2006.03.029MaRDI QIDQ2500537zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

graph theorydiameterdominationnetwork reliability

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 91033 (Why is no real title available?)
• scientific article; zbMATH DE number 1735793 (Why is no real title available?)
• A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
• A Survey of Network Reliability and Domination Theory
• A Unified Formula for Analysis of Some Network Reliability Problems
• Approximating the weight of shallow Steiner trees
• Augmenting trees to meet biconnectivity and diameter constraints
• Computational Complexity of Coherent Systems and the Reliability Polynomial
• Domination theory and the crapo β-invariant
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
• Parallel concepts in graph theory
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected

Cited in

(5)

• On computing the 2-diameter-constrained \(K\)-reliability of networks
• Oriented matroid systems
• A Survey of Network Reliability and Domination Theory
• Computing diameter constrained reliability of a network with junction points
• Directed network reliability: Domination and computing coefficients of the success‐marginal expansion

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)