Factorization of network reliability with perfect nodes. I: Introduction and statements

DOI10.1016/j.dam.2015.06.006zbMath1327.05311arXiv1305.0972OpenAlexW1222714204MaRDI QIDQ897587

Juan Manuel Burgos, Franco Robledo Amoza

Publication date: 7 December 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.0972

zbMATH Keywords

graph theoryfactorizationnetwork reliability

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (4)

Sixty years of network reliability ⋮ Factorization of network reliability with perfect nodes. II: Connectivity matrix ⋮ Singularities in Negami's splitting formula for the Tutte polynomial ⋮ VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY

Cites Work

• Unnamed Item
• Factorization of network reliability with perfect nodes. II: Connectivity matrix
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
• System Effectiveness Evaluation Using Star and Delta Transformations
• Computing the Reliability of Complex Networks
• Network reliability and the factoring theorem

This page was built for publication: Factorization of network reliability with perfect nodes. I: Introduction and statements