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 ...
Read More
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.
Read Less
Add this copy of The Combinatorics of Network Reliability to cart. $45.83, very good condition, Sold by ThriftBooks-Baltimore rated 4.0 out of 5 stars, ships from Halethorpe, MD, UNITED STATES, published 1987 by Oxford University Press, USA.
Add this copy of The Combinatorics of Network Reliability (International to cart. $104.28, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 1987 by Oxford University Press.
