Computing K-terminal reliability of d-trapezoid graphs

DOI10.1016/J.IPL.2013.07.006zbMATH Open1284.05299OpenAlexW1964464279MaRDI QIDQ2445238FDOQ2445238

Min-Sheng Lin, Chao-Chun Ting

Publication date: 14 April 2014

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

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

Recommendations

• A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs
• Computing the \(K\)-terminal reliability of directed path graphs
• Algorithms for K-terminal reliability problems with node failures
• scientific article; zbMATH DE number 1263176
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks

zbMATH Keywords

algorithmsreliabilityinterval graph\(d\)-trapezoid graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Treewidth and Pathwidth of Permutation Graphs
• Treewidth and Minimum Fill-in on d-Trapezoid Graphs
• On powers of \(m\)-trapezoid graphs
• Efficient algorithms for computing the reliability of permutation and interval graphs
• Computing 2-terminal reliability for radio-broadcast networks
• Data communications, computer networks, and open systems.

Cited In (3)

• Algorithms for K-terminal reliability problems with node failures
• A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs
• Computing the \(K\)-terminal reliability of directed path graphs

This page was built for publication: Computing \(K\)-terminal reliability of \(d\)-trapezoid graphs

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