Applied combinatorics / by Alan Tucker
Material type: TextPublication details: New Delhi : John Wiley & sons, 2010, 2007cEdition: 5th edDescription: xi, 476 p. ill. ; 24 cmISBN: 9788126526420Subject(s): Combinatorial analysis | MathematicsDDC classification: 511.64
Contents:
Preliminaries -- General counting methods for arrangements and selections -- Generating functions -- Recurrence relations -- Inclusion-exclusion -- Polya's enumeration formula -- Elements of graph theory -- Covering circuits and graph coloring -- Trees and searching -- Network algorithms -- Games with graphs.
Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
Books | Namal Library Mathematics | 511.64 TUC-A 2010 270 (Browse shelf (Opens below)) | Available | 270 | |||
Books | Namal Library Mathematics | 511.64 TUC-A 2010 3798 (Browse shelf (Opens below)) | 2 | Available | 0003798 |
Total holds: 0
Browsing Namal Library shelves, Shelving location: Mathematics Close shelf browser (Hides shelf browser)
511.6 RAM-D 2009 4686 Discrete mathematical structures with applications to combinatorics | 511.6 TUC-A 2017 10564 Applied combinatorics / | 511.64 TUC-A 2010 3798 Applied combinatorics / | 511.64 TUC-A 2010 270 Applied combinatorics / | 511.66 NAH-W 2004 12845 When least is best : how mathematicians discovered many clever ways to make things as small (or as large) as possible / | 511.8 BHO-D 2011 299 Design and analysis of algorithms / | 511.8 DAV-D 2012 1981 Design and analysis of algorithms / |
Index included
Preliminaries -- General counting methods for arrangements and selections -- Generating functions -- Recurrence relations -- Inclusion-exclusion -- Polya's enumeration formula -- Elements of graph theory -- Covering circuits and graph coloring -- Trees and searching -- Network algorithms -- Games with graphs.
There are no comments on this title.