Results of research on classical combinatorial structures such as random graphs, permutations, and systems of random linear equations in finite fields.
This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows.
This introduction to combinatorics, the foundation of the interaction between computer science and mathematics, is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics.
A unique approach illustrating discrete distribution theory through combinatorial methods This book provides a unique approach by presenting combinatorial methods in tandem with discrete distribution theory.
A timely convergence of two widely used disciplines Random Graphs for Statistical Pattern Recognition is the first book to address the topic of random graphs as it applies to statistical pattern recognition.
The leading reference on probabilistic methods in combinatorics-now expanded and updated When it was first published in 1991, The Probabilistic Method became instantly the standard reference on one of the most powerful and widely used tools in combinatorics.
Quality measurement, control, and improvement in combinatorial chemistry Combinatorial chemistry has developed rapidly in the past decade, with great advances made by scientists working on analysis and purification of a large number of compounds and the analysis of polymer-bound compounds.
This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring.
