# The Leading eBooks Store Online

## 3,788,875 members ⚫ 1,234,658 ebooks

Most popular at the top

#### The Traveling Salesman Problem and Its Variations

Springer US 2006; US$ 179.47A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound,... more...

#### Polynomial Identities And Combinatorial Methods

CRC Press 2003; US$ 275.00Polynomial Identities and Combinatorial Methods presents a wide range of perspectives on topics ranging from ring theory and combinatorics to invariant theory and associative algebras. It covers recent breakthroughs and strategies impacting research on polynomial identities and identifies new concepts in algebraic combinatorics, invariant and representation... more...

#### Extremal Combinatorial Problems and Their Applications

Springer Netherlands 2007; US$ 89.73Combinatorial research has proceeded vigorously in Russia over the last few decades, based on both translated Western sources and original Russian material. The present volume extends the extremal approach to the solution of a large class of problems, including some that were hitherto regarded as exclusively algorithmic, and broadens the choice... more...

#### Association Schemes

Cambridge University Press 2004; US$ 54.00This book covers association schemes for graduate mathematicians and statisticians, minimum prerequisites, numerous examples and exercises. more...

#### Additive Combinatorics

Cambridge University Press 2006; US$ 54.00A graduate-level 2006 text bringing together the tools from different fields used in additive combinatorics. more...

#### Theory of Association Schemes

Springer Berlin Heidelberg 2006; US$ 89.73The present text is an introduction to the theory of association schemes. We start with the de?nition of an association scheme (or a scheme as we shall say brie?y), and in order to do so we ?x a set and call it X. We write 1 to denote the set of all pairs (x,x) with x? X. For each subset X ? r of the cartesian product X×X, we de?ne r to be the set... more...

#### Matching Theory

Elsevier Science 1986; US$ 72.95This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic... more...

#### Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity

Elsevier Science 1992; US$ 72.95This volume in the Annals of Discrete Mathematics brings together contributions by renowned researchers in combinatorics, graphs and complexity. The conference on which this book is based was the fourth in a series which began in 1963, which was the first time specialists from East and West were able to come together. The 1990 meeting attracted 170... more...

#### Analytic Combinatorics

Cambridge University Press 2009; US$ 88.00The definitive treatment of analytic combinatorics, from leaders in the field. Exercises, examples, appendices and notes aid understanding. more...

#### Combinatorics '90

Elsevier Science 1992; US$ 72.95This volume forms a valuable source of information on recent developments in research in combinatorics, with special regard to the geometric point of view. Topics covered include: finite geometries (arcs, caps, special varieties in a Galois space; generalized quadrangles; Benz planes; foundation of geometry), partial geometries, Buekenhout geometries,... more...