
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn 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.
This book investigates the application of combinatorial methods to the analysis of network reliability within probabilistic models. The author, Charles J. Colbourn, provides a rigorous examination of how discrete mathematical structures can quantify the robustness of complex systems. By synthesizing classical connectivity theorems with advanced set theory and matroid analysis, the text establishes a formal framework for evaluating network failure and performance.
What You Will Find
Experts recognize this work as a specialized reference for advanced students and researchers in discrete mathematics and computer science. Readers frequently note the technical density of the proofs and the book's focus on the theoretical foundations of network reliability.
Page Count:
160
Publication Date:
1987-05-21
Publisher:
Oxford University Press
ISBN-10:
0195049209
ISBN-13:
9780195049206
No comments yet. Be the first to share your thoughts!