Normal view MARC view ISBD view

Applied combinatorics / Alan Tucker.

By: Tucker, Alan, 1943 July 6-.
Material type: TextTextPublisher: Hoboken, NJ : John Wiley and Sons, c2012Edition: 6th ed.Description: xv, 480 p. ; 25 cm.ISBN: 9780470458389 (acid free paper).Subject(s): Combinatorial analysis | Graph theoryDDC classification: 511.6 Other classification: MAT036000 Online resources: Ebook Fulltext
Contents:
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.
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"--
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
E-Book E-Book EWU Library
E-book
Non-fiction 511.6 TUA 2012 (Browse shelf) Not For Loan
Total holds: 0

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"--

Applied Statistics

There are no comments for this item.

Log in to your account to post a comment.

Library Home | Contacts | E-journals
Copyright @ 2011-2019 EWU Library
East West University