scientific article; zbMATH DE number 4187439

MaRDI QIDQ5752277zbMATH OpenFDO

Authors Peter Slater

Publication date 1989

zbMATH Keywords

communication networkNP-hardspanning subgraphprobabilistic graphreliability measurepair-connected reliability polynome

Mathematics Subject Classification ID

Partial orders, general (06A06) Reliability, availability, maintenance, inspection in operations research (90B25) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 4091558
• Computing residual connectedness reliability for restricted networks
• On the nonexistence of uniformly optimal graphs for pair-connected reliability
• Reliability Computations for Planar Networks
• The Complexity of Reliability Computations in Planar and Acyclic Graphs

Cited in

(9)

• The Complexity of Reliability Computations in Planar and Acyclic Graphs
• scientific article; zbMATH DE number 4091558 (Why is no real title available?)
• scientific article; zbMATH DE number 640394 (Why is no real title available?)
• Reliability polynomials and their asymptotic limits for families of graphs
• Computing residual connectedness reliability for restricted networks
• Two-edge connected reliability of two-paths
• Non-Stanley bounds for network reliability
• Reliability covering problems for hypergraphs
• scientific article; zbMATH DE number 4116575 (Why is no real title available?)

This page was built for publication:

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