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
یادداشتهای مربوط به کتابنامه ، واژه نامه و نمایه های داخل اثر
متن يادداشت
Includes bibliographical references and index
یادداشتهای مربوط به خلاصه یا چکیده
متن يادداشت
"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"--
موضوع (اسم عام یاعبارت اسمی عام)
موضوع مستند نشده
Combinatorial analysis
موضوع مستند نشده
Graph theory
رده بندی ديویی
شماره
511/
.
6
ويراست
23
رده بندی کنگره
شماره رده
QA164
نشانه اثر
.
T83
2012
نام شخص به منزله سر شناسه - (مسئولیت معنوی درجه اول )