Combinatorics of Network Reliability

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.Colbourn, Charles J. is the author of 'Combinatorics of Network Reliability', published 1987 under ISBN 9780195049206 and ISBN 0195049209.