Cargando…

Applied combinatories /

Presents many examples from the biological, computer, and social sciences as well as many other areas, including disease screening, genome mapping, satellite communication, search engines, telecommunications traffic, web data, smallpox vaccinations, sound systems, oil drilling, dynamic labor markets...

Descripción completa

Detalles Bibliográficos
Clasificación:QA164 R6.22 2009
Autor principal: Roberts, Fred S
Otros Autores: Tesman, Barry
Formato: Libro
Idioma:Inglés
Publicado: Boca Raton : Chapman & Hall/CRC, 2009.
Edición:2a ed. /
Temas:
Descripción
Sumario:Presents many examples from the biological, computer, and social sciences as well as many other areas, including disease screening, genome mapping, satellite communication, search engines, telecommunications traffic, web data, smallpox vaccinations, sound systems, oil drilling, dynamic labor markets, data mining, and distributed computing Covers 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, and consensus decoding Emphasizes problem solving through a range of exercises that either test routine ideas, introduce new concepts and applications, or challenge readers to use the combinatorial techniques developed Includes answers to selected exercises in the appendix Summary 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.
Notas:"A Chapman & Hall book."
Originalmente publicado: 2nd ed. Upper Saddle River, N.J. : Pearson Education/Prentice-Hall, c2005.
Descripción Física:xxvii, 860 p. : il. ; 27 cm.
Bibliografía:Incluye referencias bibliográficas e índice.
ISBN:9781420099829
1420099825