Applied combinatorics Alan Tucker.
Material type: TextPublication details: New Delhi : Wiley India Pvt. Ltd.,, 2017.Edition: 6th edDescription: xv, 480 p. ; 25 cmISBN:- 9788126566198 (Pbk)
- 511.6 T79A6 23
- QA164 .T83 2012
Item type | Current library | Collection | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|
Books | Central Library, IISER Bhopal Reference Section | Reference | 511.6 T79A6 (Browse shelf(Opens below)) | Checked out to Parikshit De (0193) Not For Loan | 27/01/2024 | G0504 |
Formerly CIP. Uk
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.