Computing the \(K\)-terminal reliability of directed path graphs

DOI10.1016/j.ipl.2015.05.005zbMath1329.68145OpenAlexW256237781MaRDI QIDQ2348708

Chao-Chun Ting, Min-Sheng Lin

Publication date: 15 June 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.05.005

zbMATH Keywords

algorithmsrooted directed path graphsdirected path graphs\(K\)-terminal reliability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Reliability, availability, maintenance, inspection in operations research (90B25) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Intersection graphs of paths in a tree
• Linear-time algorithms for computing the reliability of bipartite and (\(\# \leqslant 2\)) star distributed computing systems.
• On powers of \(m\)-trapezoid graphs
• Computing \(K\)-terminal reliability of \(d\)-trapezoid graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Efficient algorithms for computing the reliability of permutation and interval graphs
• Fast Algorithms for Finding Nearest Common Ancestors
• The Complexity of Enumeration and Reliability Problems
• Reliability covering problems

This page was built for publication: Computing the \(K\)-terminal reliability of directed path graphs