Applied Combinatorics
Seiten
2009
|
2nd edition
Chapman & Hall/CRC (Verlag)
978-1-4200-9982-9 (ISBN)
Chapman & Hall/CRC (Verlag)
978-1-4200-9982-9 (ISBN)
- Lieferbar
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
Zu diesem Artikel existiert eine Nachauflage
Presents the tools of combinatorics from an applied point of view. This book focuses on three basic problems of combinatorics: counting, existence, and optimization problems. It contains many examples from the biological, computer, and social sciences, including disease screening, genome mapping, satellite communication and search engines.
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.
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.
Fred S. Roberts is Professor of Mathematics and Director of DIMACS at Rutgers University. Barry Tesman is Professor of Mathematics at Dickinson College.
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.
| Erscheint lt. Verlag | 4.6.2009 |
|---|---|
| Reihe/Serie | Discrete Mathematics and Its Applications |
| Zusatzinfo | 85 Tables, black and white; 309 Illustrations, black and white |
| Sprache | englisch |
| Maße | 178 x 254 mm |
| Gewicht | 3750 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Angewandte Mathematik |
| Mathematik / Informatik ► Mathematik ► Graphentheorie | |
| ISBN-10 | 1-4200-9982-5 / 1420099825 |
| ISBN-13 | 978-1-4200-9982-9 / 9781420099829 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Anwendungen und Theorie von Funktionen, Distributionen und Tensoren
Buch | Softcover (2023)
De Gruyter Oldenbourg (Verlag)
CHF 97,90
Buch | Hardcover (2024)
Hanser (Verlag)
CHF 55,95
