Applied Combinatorics

2. Auflage 2009
ISBN: 978-1-4200-9982-9
Verlag: Chapman and Hall/CRC

Buch, Englisch, 888 Seiten, Format (B × H): 183 mm x 260 mm, Gewicht: 1834 g

Now with solutions to selected problems, Applied Combinatorics, Second Edition presents the tools of combinatorics from an applied point of view. This bestselling textbook offers numerous references to the literature of combinatorics and its applications that enable readers to delve more deeply into the topics.

After introducing fundamental counting rules and the tools of graph theory and relations, the authors focus on three basic problems of combinatorics: counting, existence, and optimization problems. They discuss advanced tools for dealing with the counting problem, including generating functions, recurrences, inclusion/exclusion, and Pólya theory. The text then covers combinatorial design, coding theory, and special problems in graph theory. It also illustrates the basic ideas of combinatorial optimization through a study of graphs and networks.

Zielgruppe

statisticians and life scientists and others doing extensive investigations.

Autoren/Hrsg.

Roberts, Fred S.

Roberts, Fred

Tesman, Barry

Fachgebiete

• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
• Mathematik | Informatik Mathematik Algebra Elementare Algebra
• Mathematik | Informatik Mathematik Operations Research Graphentheorie
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Computeranwendungen in der Mathematik

Inhaltsverzeichnis

What Is Combinatorics? THE BASIC TOOLS OF COMBINATORICS: Basic Counting Rules. Introduction to Graph Theory. Relations. THE COUNTING PROBLEM: Generating Functions and Their Applications. Recurrence Relations. The Principle of Inclusion and Exclusion. The Pólya Theory of Counting. THE EXISTENCE PROBLEM: Combinatorial Designs. Coding Theory. Existence Problems in Graph Theory. COMBINATORIAL OPTIMIZATION: Matching and Covering. Optimization Problems for Graphs and Networks. Appendix. Indices.

Über Autor(innen)

Fred S. Roberts is Professor of Mathematics and Director of DIMACS at Rutgers University.

Barry Tesman is Professor of Mathematics at Dickinson College.