Applied combinatorics
Tucker, Alan
creator
text
bibliography
nju
New Delhi
Wiley
©1995
2012
6th ed.
monographic
eng
xv, 480 p. ; ill. : 25 cm.
"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.
Alan Tucker
Includes bibliographical references and index.
Combinatorial analysis
Graph theory
MATHEMATICS / Combinatorics
QA164 .T83 2012
511.6 TUC-A
MAT036000
9788126566198
2011044318
DLC
111031
20191112020002.0
17028849