Description
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. (Description from external book data)
listed in Combinatorial designs and configurations. | 3 similar books linked from this page.
Offers
Currently unavailable
There are no swap offers for this book right now.
Only Offers/Searches from registered users with name will be displayed. Set up a name here to see your offers.
Rate/Setting
Please log in to rate or offer books. Log in
Offer this book
Log in to add your own offer, choose the format and describe delivery options.
More to discover
Find more books by this author, in this category or in the same language.