The Leading eBooks Store Online
for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry...
New to eBooks.com?Learn more
- Bestsellers - This Week
- Foreign Language Study
- Bestsellers - Last 6 months
- Graphic Books
- Health & Fitness
- Political Science
- Biography & Autobiography
- Psychology & Psychiatry
- Body Mind & Spirit
- House & Home
- Business & Economics
- Children's & Young Adult Fiction
- Juvenile Nonfiction
- Language Arts & Disciplines
- Crafts & Hobbies
- Science Fiction
- Current Events
- Literary Collections
- Literary Criticism
- Literary Fiction
- Social Science
- The Environment
- Sports & Recreation
- Family & Relationships
- Study Aids
- Folklore & Mythology
- Food and Wine
- Performing Arts
- True Crime
- Foreign Language Books
Most popular at the top
- Elsevier Science 1985; US$ 72.95
This 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...
- Elsevier Science 1991; US$ 72.95
The 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...
- Elsevier Science 1984; US$ 72.95
Graph 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...
- Elsevier Science 1992; US$ 72.95
The 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...
- Elsevier Science 1985; US$ 72.95
The 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...
- Elsevier Science 1989; US$ 72.95
Haim 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...
- Springer 2008; US$ 119.00
Presents a number of algorithms, and includes chapters devoted to topics such as branchings, feedback arc and vertex sets, connectivity augmentations, sparse subdigraphs with prescribed connectivity. This book focuses on applications which include quantum mechanics, bioinformatics, embedded computing, and the travelling salesman problem. more...
- Springer 2009; US$ 189.00
Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. This book provides an introduction into various aspects of trees in random settings and a systematic treatment of the involved mathematical techniques. more...