Applied combinatorics
Material type: TextPublication details: New Delhi : Wiley, ©1995Edition: 6th edDescription: xv, 480 p. ; ill. : 25 cmISBN:- 9788126566198
- 511.6 23 TUC-A
- QA164 .T83 2012
- MAT036000
Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | Course reserves |
---|---|---|---|---|---|---|---|---|
Highly Demanded Book | IIITD Reference | Mathematics | REF 511.6 TUC-A (Browse shelf(Opens below)) | Not for loan | 008180 | |||
Highly Demanded Book | IIITD General Stacks | Mathematics | 511.6 TUC-A (Browse shelf(Opens below)) | Available | 007551 |
Includes bibliographical references and index.
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.
"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.