This combinatorics text provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. It presents the computer and software algorithms in pseudo-code and incorporates definitions, theorems, proofs, examples, and nearly 300 illustrations as pedagogical elements of the exposition. Numerous problems, solutions, and hints reinforce basic skills and assist with creative problem solving. The author also offers a website with extensive graph theory informational resources as well as a computational engine to help with calculations for some of the exercises.
Rezensionen / Stimmen
... The book is very carefully written and might be a good starting point for undergraduate students. ...
-Zentralblatt MATH 1168
I recently got [this] book on combinatorics and applications to computer science, and I like it so much that I am trying to re-shape some of the discrete maths courses I teach so that I could use it. I liked particularly [the] section on asymptotics, which is much more accessible for my undergrads than Graham, Knuth, and Patashnik.
-Josef Lauri, University of Malta
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
ISBN-13
978-1-040-17108-0 (9781040171080)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Preface. Introduction to Combinatorics. Sequences. Solving Recurrences. Evaluating Sums. Subsets and Binomials. Partitions and Permutations. Integer Operators. Graph Fundamentals. Graph Theory Topics. Graph Enumeration. Designs. Appendix. Bibliography. Solutions and Hints. Indices.
