A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
From MaRDI portal
Publication:3694715
DOI10.1137/0214057zbMath0575.68072OpenAlexW4245681882MaRDI QIDQ3694715
No author found.
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0214057
Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Related Items (27)
Sixty years of network reliability ⋮ The computational complexity of the reliability problem on distributed systems ⋮ A note on algebraic expressions of rhomboidal labeled graphs ⋮ A new fractal reliability model for networks with node fractal growth and no-loop ⋮ Computing optimal assignments for residual network reliability ⋮ On lengths of edge-labeled graph expressions ⋮ A decomposition algorithm for network reliability evaluation ⋮ A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems ⋮ Algebraic Methods Applied to Network Reliability Problems ⋮ On algebraic expressions of directed grid graphs ⋮ Fast reliability ranking of matchstick minimal networks ⋮ Exact reliability optimization for series‐parallel graphs using convex envelopes ⋮ Uniformly optimally reliable graphs: A survey ⋮ On network reliability evaluation by Monte Carlo method using high-performance computing ⋮ Uniformly most reliable three-terminal graph of dense graphs ⋮ Network Resilience ⋮ VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY ⋮ Tutte polynomials computable in polynomial time ⋮ A new simulation method based on the RVR principle for the rare event network reliability problem ⋮ A survey of very large-scale neighborhood search techniques ⋮ Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming ⋮ Computational complexity of impact size estimation for spreading processes on networks ⋮ High-confidence estimation of small s -t reliabilities in directed acyclic networks ⋮ MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS ⋮ Convex envelopes for ray-concave functions ⋮ Analysis and synthesis problems for network resilience ⋮ Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
This page was built for publication: A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
