01984nam a22003494a 4500
8170
BD-DhEWU
20180131131335.0
180131s2012 njua g b 001 0 eng d
2011044318
9780470458389 (acid free paper)
DLC
DLC
DLC
BD-DhEWU
eng
eng
QA164
.T83 2012
511.6
TUA 2012
MAT036000
bisacsh
Tucker, Alan.
1943 July 6-
21849
Applied combinatorics /
Alan Tucker.
6th ed.
Hoboken, NJ :
John Wiley and Sons,
c2012.
xv, 480 p. ;
25 cm.
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"--
AS
Saifun Momota
Combinatorial analysis.
21850
Graph theory.
21851
Ebook Fulltext
http://lib.ewubd.edu/ebook/8170
ddc
EBOOK
8170
8170
8170
8170
0
0
ddc
0
1
NFIC
EWU
EWU
EBOOK
2018-01-31
0
511.6 TUA 2012
2018-01-31
2018-01-31
EBOOK