000  01984nam a22003494a 4500  

001  8170  
003  BDDhEWU  
005  20180131131335.0  
008  180131s2012 njua g b 001 0 eng d  
010  _a2011044318  
020  _a9780470458389 (acid free paper)  
040 
_aDLC _cDLC _dDLC _dBDDhEWU _beng 

041  _aeng  
050  0  0 
_aQA164 _b.T83 2012 
082  0  4 
_a511.6 _bTUA 2012 
084 
_aMAT036000 _2bisacsh 

100  1 
_aTucker, Alan. _d1943 July 6 _921849 

245  1  0 
_aApplied combinatorics / _cAlan Tucker. 
250  _a6th ed.  
260 
_aHoboken, NJ : _bJohn Wiley and Sons, _cc2012. 

300 
_axv, 480 p. ; _c25 cm. 

504  _aIncludes bibliographical references and index.  
505  8  _aMachine 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: InclusionExclusion. Part Three: Additional Topics. Chapter 9: Polya's Enumeration Formula. Chapter 10: Games with Grapes. Postlude. Appendix.  
520  _a"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"  
526  _aAS  
590  _aSaifun Momota  
650  0 
_aCombinatorial analysis. _921850 

650  0 
_aGraph theory. _921851 

856  4  2 
_3Ebook Fulltext _uhttp://lib.ewubd.edu/ebook/8170 
942 
_2ddc _cEBOOK 

999 
_c8170 _d8170 

999 
_c8170 _d8170 