# The Leading eBooks Store Online

## for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry...

Most popular at the top

#### Algorithms in Combinatorial Design Theory

Elsevier Science 1985; US$ 72.95The scope of the volume includes all algorithmic and computational aspects of research on combinatorial designs. Algorithmic aspects include generation, isomorphism and analysis techniques - both heuristic methods used in practice, and the computational complexity of these operations. The scope within design theory includes all aspects of block designs,... more...

#### Hypergraphs

Elsevier Science 1984; US$ 72.95Graph Theory has proved to be an extremely useful tool for solving combinatorial problems in such diverse areas as Geometry, Algebra, Number Theory, Topology, Operations Research and Optimization. It is natural to attempt to generalise the concept of a graph, in order to attack additional combinatorial problems. The idea of looking at a family of sets... more...

#### Combinatorial and Geometric Structures and Their Applications

Elsevier Science 1982; US$ 74.95Combinatorial and Geometric Structures and Their Applications more...

#### Combinatorial Design Theory

Elsevier Science 2011; US$ 255.00Combinatorial design theory is a vibrant area of combinatorics, connecting graph theory, number theory, geometry, and algebra with applications in experimental design, coding theory, and numerous applications in computer science. This volume is a collection of forty-one state-of-the-art research articles spanning all of combinatorial design theory.... more...

#### Combinatorial mathematics, optimal designs, and their applications

Elsevier Science 2011; US$ 146.00Combinatorial mathematics, optimal designs, and their applications more...

#### Submodular Functions and Optimization

Elsevier Science 1991; US$ 72.95The importance of submodular functions has been widely recognized in recent years in combinatorial optimization. This is the first book devoted to the exposition of the theory of submodular functions from an elementary technical level to an advanced one. A unifying view of the theory is shown by means of base polyhedra and duality for submodular and... more...

#### Cycles in Graphs

Elsevier Science 1985; US$ 72.95This volume deals with a variety of problems involving cycles in graphs and circuits in digraphs. Leading researchers in this area present here 3 survey papers and 42 papers containing new results. There is also a collection of unsolved problems. more...

#### The Steiner Tree Problem

Elsevier Science 1992; US$ 72.95The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the original points so that a spanning network of all the... more...

#### Planar Graphs

Elsevier Science 1988; US$ 72.95Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic... more...

#### Combinatorial Designs

Elsevier Science 1989; US$ 72.95Haim Hanani pioneered the techniques for constructing designs and the theory of pairwise balanced designs, leading directly to Wilson's Existence Theorem. He also led the way in the study of resolvable designs, covering and packing problems, latin squares, 3-designs and other combinatorial configurations. The Hanani volume is a collection of research... more...