Two-edge connected reliability of two-paths

MaRDI QIDQ5405495zbMATH OpenFDO

Authors Manja Reinwardt

Publication date 2 April 2014

zbMATH Keywords

reliability\(k\)-treesedge connectivity

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs
• Nonexistence of uniformly most reliable two-terminal graphs
• A recursive formula for the two‐edge connected and biconnected reliability of a complete graph
• scientific article; zbMATH DE number 4187439
• scientific article; zbMATH DE number 4091558

Cited in

(2)

• A recursive formula for the two‐edge connected and biconnected reliability of a complete graph
• Lower bound on the reliability of a network with a 2-connected structure

This page was built for publication: Two-edge connected reliability of two-paths

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