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

DOI10.1016/J.DAM.2015.06.006zbMATH Open1327.05311arXiv1305.0972OpenAlexW1222714204MaRDI QIDQ897587FDOQ897587

Juan Manuel Burgos, Franco Robledo Amoza

Publication date: 7 December 2015

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

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

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)

Cites Work

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

Cited In (4)

• Sixty years of network reliability
• VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY
• 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)