Applied combinatorics / Alan Tucker.
Material type: TextPublication details: Hoboken, NJ : John Wiley and Sons, c2012.Edition: 6th edDescription: xv, 480 p. ; 25 cmISBN:- 9780470458389
- 511.6 23 TUC
- MAT036000
Item type | Current library | Collection | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
General Books | CUTN Central Library Sciences | Non-fiction | 511.6 TUC (Browse shelf(Opens below)) | Available | 28075 |
Browsing CUTN Central Library shelves, Shelving location: Sciences, Collection: Non-fiction Close shelf browser (Hides shelf browser)
511.6 MOT Discrete Mathematics for Computer Scientists and Mathematicians / | 511.6 MOT Discrete Mathematics for Computer Scientists and Mathematicians / | 511.6 STI Combinatorial Designs Constructions Analysis / | 511.6 TUC Applied combinatorics / | 511.8 SER Mathematical Modelling / | 512 ANN Complete Algebra Companion : | 512 BOY A first book in algebra, |
Alan Tucker's newest issue of Applied Combinatorics builds on the previous editions with more in depth analysis of computer systems in order to help develop proficiency in basic discrete math problem solving. As one of the most widely used book in combinatorial problems, this edition explains how to reason and model combinatorically while stressing the systematic analysis of different possibilities, exploration of the logical structure of a problem, and ingenuity.
Machine generated contents note: Prelude. Part One: Graph Theory. Chapter 1: Elements of Graph Theory. Chapter 2: Covering Circuits and Graph coloring. Chapter 3: Trees and Searching. Chapter 4: Network Algorithms. Part Two: Enumeration. Chapter 5: General Counting Methods for Arrangements and Selections. Chapter 6: Generating Functions. Chapter 7: Recurrence Relations. Chapter 8: Inclusion-Exclusion. Part Three: Additional Topics. Chapter 9: Polya's Enumeration Formula. Chapter 10: Games with Grapes. Postlude. Appendix.
Includes bibliographical references and index.
"Alan Tucker's newest issue of Applied Combinatorics builds on the previous editions with more in depth analysis of computer systems in order to help develop proficiency in basic discrete math problem solving. As one of the most widely used book in combinatorial problems, this edition explains how to reason and model combinatorically while stressing the systematic analysis of different possibilities, exploration of the logical structure of a problem, and ingenuity"--
There are no comments on this title.