Amazon cover image
Image from Amazon.com

Applied combinatorics

By: Material type: TextTextPublication details: New Delhi : Wiley, ©1995Edition: 6th edDescription: xv, 480 p. ; ill. : 25 cmISBN:
  • 9788126566198
Subject(s): DDC classification:
  • 511.6 23 TUC-A
LOC classification:
  • QA164 .T83 2012
Other classification:
  • MAT036000
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.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds Course reserves
Highly Demanded Book Highly Demanded Book IIITD Reference Mathematics REF 511.6 TUC-A (Browse shelf(Opens below)) Not for loan 008180

Combinatorics and its Applications UG/PG (REST) WNT24

Highly Demanded Book Highly Demanded Book IIITD General Stacks Mathematics 511.6 TUC-A (Browse shelf(Opens below)) Available 007551
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"--

There are no comments on this title.

to post a comment.
© 2024 IIIT-Delhi, library@iiitd.ac.in