Computing rooted communication reliability in an almost acyclic digraph

DOI10.1002/net.3230210507zbMath0751.90033OpenAlexW2022704928MaRDI QIDQ3978609

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

directed networkrandom failureunreliable arcsalmost acyclic digraphroot-vertex

Mathematics Subject Classification ID

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

Related Items (3)

Network reliability: Heading out on the highway ⋮ Unnamed Item ⋮ A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability

Cites Work

• Unnamed Item

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