Charles J. Colbourn

Miroslav Kraetzl

Daryl D Harms

Stanley J. Devitt

Network Reliability: Experiments with a Symbolic Algebra Environment examines two intertwined topics: computational methods for computing bounds on three measures of network reliability, and a symbolic algebra system to support these computations. It describes, in algorithmic outlines, efficient techniques for reliability bounds and discusses the implementation of the techniques. It explores all-terminal reliability, two-terminal reliability, and reliability of interconnection networks. Consistent with real-world experience, the computational environment and results are strongly supported by sound theoretical development.

Experiments with a Symbolic Algebra Environment

Network Reliability

Stephen Semmes

Alessandra Carbone

Department of Mathematics and Computer Science Alessandra Carbone

This book brings into focus the contrast between explicit and implicit algorithmic descriptions of objects and presents a new geometric language for the study of combinatorial and logical problems in complexity theory. These themes are considered in a variety of settings, sometimes crossing traditional boundaries. Special emphasis is given to moderate complexity - exponential or polynomial - but objects with multi-exponential complexity also fit in. Among the items under consideration are graphs, formal proofs, languages, automata, groups, circuits, some connections with geometry of metric spaces, and complexity classes (P, NP, co-NP).

A Graphic Apology for Symmetry and Implicitness

Roberto Grossi

Nadia Pisanti

This book constitutes the refereed post-conference proceedings of the 30th International Workshop on Combinatorial Algorithms, IWOCA 2019, held in Pisa, Italy, in July 2019. The 36 regular papers presented in this volume were carefully reviewed and selected from 73 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and information security, algorithms on strings and graphs, graph drawing and labelling, computational algebra and geometry, computational biology, probabilistic and randomized algorithms, algorithms for big data analytics, and new paradigms of computation.

30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings

Combinatorial Algorithms

Department of Computer Science Charles J Colbourn

Alexander Rosa

Triple systems are among the simplest combinatorial designs. They have applications in coding theory, cryptography, computer science, statistcs, and many other areas. This book provides the first systematic and comprehensive treatment of triple systems. It gives an accurate picture of an incredibly rich and vibrant area of combinatorial mathematics.

Triple Systems

Jeffrey H. Dinitz

Continuing in the bestselling, informative tradition of the first edition, the Handbook of Combinatorial Designs, Second Edition remains the only resource to contain all of the most important results and tables in the field of combinatorial design. This handbook covers the constructions, properties, and applications of designs as well as existence

Handbook of Combinatorial Designs

From experimental design to cryptography, this comprehensive, easy-to-access reference contains literally all the facts you need on combinatorial designs. It includes constructions of designs, existence results, and properties of designs. Organized into six main parts, the CRC Handbook of Combinatorial Designs covers:

Charles J. Colbourn

About

Books

Join the club