Computing 2-terminal reliability for radio-broadcast networks

DOI10.1109/24.46478zbMath0691.90032OpenAlexW2146784429WikidataQ56966562 ScholiaQ56966562MaRDI QIDQ3033541

Charles J. Colbourn, Hosam M. F. Aboelfotoh

Publication date: 1989

Published in: IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/24.46478

zbMATH Keywords

network reliabilitysubgraph countingunreliable links2-terminal reliabilityprobabilistic graph modelratio broadcast networksseries-parallel reducible graphsvertex-packing bounds

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25) Traffic problems in operations research (90B20) Graph theory (05C99)

Related Items (5)

Network reliability and the probabilistic estimation of damage from fire spread ⋮ Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases ⋮ Computing \(K\)-terminal reliability of \(d\)-trapezoid graphs ⋮ Computing residual connectedness reliability for restricted networks ⋮ A survey of some network reliability analysis and synthesis results

This page was built for publication: Computing 2-terminal reliability for radio-broadcast networks