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

DOI10.1016/J.DAM.2015.06.006MaRDI QIDQ897587zbMATH OpenOpenAlexFDO

Authors 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

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

Abstract: A new general all terminal network reliability factorization theorem is stated. We relegate the proof to a forthcoming second part paper.

Cites work

• scientific article; zbMATH DE number 49666 (Why is no real title available?)
• A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
• Computing the Reliability of Complex Networks
• Factorization of network reliability with perfect nodes. II: Connectivity matrix
• Network reliability and the factoring theorem
• System Effectiveness Evaluation Using Star and Delta Transformations
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected

Cited in

(5)

• Sixty years of network reliability
• VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY
• An optimization-based Monte Carlo method for estimating the two-terminal survival signature of networks with two component classes
• Factorization of network reliability with perfect nodes. II: Connectivity matrix
• Singularities in Negami's splitting formula for the Tutte polynomial

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897587)