scientific article; zbMATH DE number 4019092

MaRDI QIDQ3030848zbMATH OpenFDO

Authors Aparna Ramesh, Michael O. Ball, Charles J. Colbourn

Publication date 1987

zbMATH Keywords

all-terminal reliabilitycommunication networkconnected subgraphsplanar networks

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Reliability, availability, maintenance, inspection in operations research (90B25) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Invulnerability of planar two-tree networks
• Combining monte carlo estimates and bounds for network reliability
• Improving reliability bounds in computer networks
• Reliability Computations for Planar Networks
• Network reliability

Cited in

(9)

• Chip firing and all-terminal network reliability bounds
• Invulnerability of planar two-tree networks
• Bounds of two-terminal network reliability and base spectrum of network graph
• Non-Stanley bounds for network reliability
• Counting almost minimum cutsets with reliability applications
• scientific article; zbMATH DE number 4045783 (Why is no real title available?)
• scientific article; zbMATH DE number 1490110 (Why is no real title available?)
• scientific article; zbMATH DE number 7375995 (Why is no real title available?)
• A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability

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 Q3030848)