# The Leading eBooks Store Online

## 3,907,956 members ⚫ 1,273,926 ebooks

Most popular at the top

#### The Pursuit of Perfect Packing, Second Edition

CRC Press 2008; US$ 79.95Coauthored by one of the creators of the most efficient space packing solution, the Weaire–Phelan structure, The Pursuit of Perfect Packing, Second Edition explores a problem of importance in physics, mathematics, chemistry, biology, and engineering: the packing of structures. Maintaining its mathematical core, this edition continues and revises... more...

#### Probability and Real Trees

Springer Berlin Heidelberg 2007; US$ 44.78Random trees and tree-valued stochastic processes are of particular importance in combinatorics, computer science, phylogenetics, and mathematical population genetics. Using the framework of abstract "tree-like" metric spaces (so-called real trees) and ideas from metric geometry such as the Gromov-Hausdorff distance, Evans and his collaborators have... more...

#### Graph Theory and Interconnection Networks

CRC Press 2008; US$ 199.95The advancement of large scale integrated circuit technology has enabled the construction of complex interconnection networks. Graph theory provides a fundamental tool for designing and analyzing such networks. Graph Theory and Interconnection Networks provides a thorough understanding of these interrelated topics. After a brief introduction to graph... more...

#### Graph Theory with Applications

New Age International Pvt. Ltd., Publishers 2006; US$ 30.00Salient Features Over 1500 problems are used to illustrate concepts, related to different topics, and introduce applications. Over 1000 exercises in the text with many different types of questions posed. Precise mathematical language is used without excessive formalism and abstraction. Care has been taken to balance the mix of notation and words... 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...

#### 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...

#### 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...

#### 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...

#### Quo Vadis, Graph Theory?

Elsevier Science 1993; US$ 72.95Graph Theory (as a recognized discipline) is a relative newcomer to Mathematics. The first formal paper is found in the work of Leonhard Euler in 1736. In recent years the subject has grown so rapidly that in today's literature, graph theory papers abound with new mathematical developments and significant applications. As with any academic field, it... more...

#### Recent Results in the Theory of Graph Spectra

Elsevier Science 1988; US$ 72.95The purpose of this volume is to review the results in spectral graph theory which have appeared since 1978. The problem of characterizing graphs with least eigenvalue -2 was one of the original problems of spectral graph theory. The techniques used in the investigation of this problem have continued to be useful in other contexts including forbidden... more...