scientific article; zbMATH DE number 26483

MaRDI QIDQ3983244zbMATH OpenFDO

Authors Venkatesh Raman

Publication date 27 June 1992

zbMATH Keywords

computer networksedge-packinglower boundprobabilistic graphsprobabilityreliability

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• scientific article; zbMATH DE number 4097115
• Reliability Computations for Planar Networks
• The Complexity of the Residual Node Connectedness Reliability Problem
• Series-Parallel Bounds for the Two-Terminal Reliability Problem

Cited in

(4)

• Computational Complexity of Network Reliability Analysis: An Overview
• A simple variant of node connectivity is NP-complete
• Complexity of Network Reliability and Optimal Resource Placement Problems
• scientific article; zbMATH DE number 975420 (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 Q3983244)