| Applied Combinatorics Contributor(s): Roberts, Fred (Author), Tesman, Barry (Author) |
|
 |
ISBN: 1420099825 ISBN-13: 9781420099829 Publisher: CRC Press OUR PRICE: $171.00 Product Type: Hardcover - Other Formats Published: June 2009 Annotation: This book focuses on the applications that motivate the development and use of combinatorics. The application examples covered include defective products, disease screening, genome mapping, satellite communication, web data, search engines, telecommunications traffic, smallpox vaccinations, sound systems, oil drilling, dynamic labor markets, and distributed computing. This edition includes new material on list colorings, the inversion distance between permutations and mutations in evolutionary biology, graph coloring, relations, DNA sequence alignment, cryptography, automorphisms of graphs, orthogonal arrays, secret sharing, the RSA cryptosystem, consensus decoding, and Menger's theorems. |
| Additional Information |
| BISAC Categories: - Computers | Operating Systems - General - Mathematics | Combinatorics - Computers | Security - General |
| Dewey: 511.6 |
| LCCN: 2009013043 |
| Physical Information: 1.7" H x 7" W x 10" (3.75 lbs) 888 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: Now with solutions to selected problems, Applied Combinatorics, Second Edition presents the tools of combinatorics from an applied point of view. This bestselling textbook offers numerous references to the literature of combinatorics and its applications that enable readers to delve more deeply into the topics. After introducing fundamental counting rules and the tools of graph theory and relations, the authors focus on three basic problems of combinatorics: counting, existence, and optimization problems. They discuss advanced tools for dealing with the counting problem, including generating functions, recurrences, inclusion/exclusion, and Pólya theory. The text then covers combinatorial design, coding theory, and special problems in graph theory. It also illustrates the basic ideas of combinatorial optimization through a study of graphs and networks. |