Computing rooted communication reliability in an almost acyclic digraph

DOI10.1002/NET.3230210507MaRDI QIDQ3978609zbMATH OpenOpenAlexFDO

Authors Jane N. Hagstrom

Publication date 25 June 1992

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230210507

zbMATH Keywords

almost acyclic digraphdirected networkrandom failureroot-vertexunreliable arcs

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Network reliability and acyclic orientations
• An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
• The Complexity of Reliability Computations in Planar and Acyclic Graphs
• High-confidence estimation of small s-t reliabilities in directed acyclic networks
• Using the Decomposition Tree for Directed-Network Reliability Computation

Cited in

(8)

• High-confidence estimation of small s-t reliabilities in directed acyclic networks
• An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
• Using the Decomposition Tree for Directed-Network Reliability Computation
• scientific article; zbMATH DE number 4002122 (Why is no real title available?)
• The strongly connected reliability of complete digraphs
• scientific article; zbMATH DE number 7375995 (Why is no real title available?)
• A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
• Network reliability: Heading out on the highway

This page was built for publication: Computing rooted communication reliability in an almost acyclic digraph

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