Applied combinatorics Book / Alan Tucker.

By:

Tucker, Alan, 1943 July 6-

Material type: Text

TextEdition: Sixth editionDescription: xv, 480 pages : illustrations ; 25 cmISBN:

9780470458389 (acid free paper)
0470458380 (acid free paper)

Subject(s):

DDC classification:

511.6 23

Other classification:

511.6

Summary: "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"-- Provided by publisher

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Date due	Barcode	Item holds
Books	COMSATS University Wah Campus Main	511.6 TUC 24135 (Browse shelf(Opens below))	Available		10004000024135
Books	COMSATS University Wah Campus Main	511.6 TUC 24136 (Browse shelf(Opens below))	Available		10004000024136

Total holds: 0

Browsing COMSATS University Wah Campus shelves, Shelving location: Main Close shelf browser (Hides shelf browser)

Previous								Next
Previous	511.3223 LEE 23358 Signal Processing First	511.3223 LEE 23360 Signal Processing First	511.6 TUC 24135 Applied combinatorics	511.6 TUC 24136 Applied combinatorics	512 SLI 24262 Algebra for applications cryptography, secret sharing, error-correcting, fingerprinting, compression /	512 SLI 24263 Algebra for applications cryptography, secret sharing, error-correcting, fingerprinting, compression /	512.02 OPI 24258 Abstract algebra applications to Galois theory, algebraic geometry, representation theory, and cryptography /	Next

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"-- Provided by publisher

All.

There are no comments on this title.

to post a comment.