WORLD'S LARGEST MARKET RESEARCH RESOURCE — 1,519,265 REPORTS

 
 
• SEARCH FOR A REPORT

Viewing report

Search
Enter keywords, a title or a report id number below.
Advanced

• ORDER BY FAX

Order By Fax

• SELECT SITE CURRENCY

Select a currency for use throughout the site



  • Hard Copy (Hard Back) Information Icon
Live Chat Live Help Software for Website

Applied Combinatorics. 6th Edition

John Wiley and Sons Ltd, March 2012, Pages: 496

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.

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 State Univ. of New York at Stony Brook.

Customers who bought this item also bought