The Combinatorics of Network Reliability (International Series of Monographs on Computer Science)

By Charles J. Colbourn

This book develops combinatorial tools which are useful for reliability analysis, as demonstrated with a probabilistic network model. Basic results in combinatorial enumeration are reviewed, along with classical theorems on connectivity and cutsets. More developed analysis involves extremal set theory, matroid theory, and polyhedral combinatorics, among other themes. The presentation includes proofs or their outlines for most of the main theorems, with the aim of highlighting combinatorial ideas. Details of relevant work are presented wherever feasible. The work is intended for advanced mathematics students and computer science specialists.

• Format: Hardcover
• Language: English
• ISBN: 0195049209
• ISBN13: 9780195049206
• Release Date: May 1987
• Publisher: Oxford University Press
• Length: 160 Pages
• Weight: 1.05 lbs.
• Dimensions: 9.6" x 0.8" x 6.4"