Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Applied Combinatorics - Alan Tucker

Applied Combinatorics

(Autor)

Buch | Softcover
464 Seiten
2001 | 4th Revised edition
John Wiley & Sons Inc (Verlag)
978-0-471-43809-0 (ISBN)
CHF 189,95 inkl. MwSt
  • Titel ist leider vergriffen;
    keine Neuauflage
  • Artikel merken
This text includes the topics: graph theory; enumeration; generating counting methods for selections and arrangements; recurrence relations; inclusion; exclusion; and Polya's enumeration formula.
This book is designed for use by students with a wide range of ability and maturity. The stronger the students, the harder the exercises that can be assigned. The book can be used for one--quarter, two--quarter, or one--semester course depending on how much material is used. Combinatorical reasoning underlies all analysis of computer systems. It plays a similar role in discrete operations research problems and in finite probability. This book teaches students in the mathematical sciences how to reason and model combinatorically. It seeks to develop proficiency in basic discrete math problem solving in the way that a calculus textbook develops proficiency in basic analysis problem solving. The three principle aspects of combinatorical reasoning emphasized in this book are: the systematic analysis of different possibilities, the exploration of the logical structure of a problem (e.g. finding manageable subpieces or first solving the problem with three objects instead of n), and ingenuity. Although important uses of combinatorics in computer science, operations research, and finite probability are mentioned, these applications are often used solely for motivation.
Numerical examples involving the same concepts use more interesting settings such as poker probabilities or logical games.

GRAPH THEORY. Elements of Graph Theory. Covering Circuits and Graph Coloring. Trees and Searching. Network Algorithms. ENUMERATION. General Counting Methods for Arrangements and Selections. Generating Functions. Recurrence Relations. Inclusion- Exclusion. ADDITIONAL TOPICS. Polya's Enumeration Formula. Games with Graphs. Appendix 1: Set Theory. Appendix 2: Mathematical Induction. Appendix 3: A Little Probability. Appendix 4: The Pigeonhole Principle. Glossary of Counting and Graph Theory Terms. Bibliography. Solutions to Odd-Numbered Problems. Index

Erscheint lt. Verlag 21.8.2001
Zusatzinfo glossary, bibliography, index
Verlagsort New York
Sprache englisch
Maße 161 x 246 mm
Gewicht 765 g
Einbandart Paperback
Themenwelt Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 0-471-43809-X / 047143809X
ISBN-13 978-0-471-43809-0 / 9780471438090
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices

von Volker Diekert; Manfred Kufleitner; Gerhard Rosenberger …

Buch | Softcover (2023)
De Gruyter (Verlag)
CHF 89,95