Bir format seçin:

zip 8.3 Mb indir
rar 5.4 Mb indir
epub 5.5 Mb indir
odf 6.3 Mb indir
djvu 5.9 Mb indir
pdf 5.2 Mb indir

The Combinatorics of Network Reliability (International Series of Monograph on Computer Science, No 3)

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.

yazar:Charles Colbourn C. J. Colbourn
Isbn 10:0195049209
Isbn 13:978-0195049206
yayınevi:Oxford University Press Inc
Boyutlar ve boyutlar:16.21 x 1.98 x 24.46 cm
Tarafından gönderildi
The Combinatorics of Network Reliability (International Series of Monograph on Computer Science, No 3):
21 Mayıs 1987