登入選單

返回Google圖書搜尋

The Combinatorics of Network Reliability

Charles J. Colbourn

出版	Oxford University Press, 1987
主題	Computers / Networking / GeneralLiterary Criticism / European / FrenchScience / Life Sciences / BotanyTechnology & Engineering / Operations Research
ISBN	01950492099780195049206
URL	http://books.google.com.hk/books?id=UajCAAAAIAAJ&hl=&source=gbs_api

註釋

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.