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.
"synopsis" may belong to another edition of this title.
Seller: Labyrinth Books, Princeton, NJ, U.S.A.
Condition: Acceptable. Seller Inventory # 252678
Seller: Saul54, Lynn, MA, U.S.A.
Hardcover. Condition: Near Fine. No Jacket. 1st Edition. Oxford University Press (1987). Embossed Black Cloth, Gilt spine and front titles, no dust jacket. Formerly The Book belonged to "United States GL Research Library": small stamp on Copyright page. "Discarded" - stamped on the libr. pocket on the back endpaper. The Book looks ASNEW. 9.5"x6.3". be45860. Seller Inventory # ABE-1485626681695