|
|
|
|
LEADER |
00000cam a2200000 4500 |
001 |
000132487 |
005 |
20120326092900.0 |
008 |
120326r20092005flu b 001 0 eng d |
020 |
|
|
|a 9781420099829
|c (hardcover : alk. paper)
|
020 |
|
|
|a 1420099825
|c (hardcover : alk. paper)
|
040 |
|
|
|a DLC
|d BDX
|d MX-MxUAM
|
050 |
|
4 |
|a QA164
|b R6.22 2009
|
082 |
0 |
0 |
|a 511/.6
|2 22
|
090 |
|
|
|a QA164
|b R6.22 2009
|
099 |
|
0 |
|a QA164
|b .R6 2009
|
100 |
1 |
|
|a Roberts, Fred S
|
245 |
1 |
0 |
|a Applied combinatories /
|c Fred Roberts.
|
250 |
|
|
|a 2a ed. /
|b Barry Tesman.
|
260 |
|
|
|a Boca Raton :
|b Chapman & Hall/CRC,
|c 2009.
|
300 |
|
|
|a xxvii, 860 p. :
|b il. ;
|c 27 cm.
|
500 |
|
|
|a "A Chapman & Hall book."
|
500 |
|
|
|a Originalmente publicado: 2nd ed. Upper Saddle River, N.J. : Pearson Education/Prentice-Hall, c2005.
|
504 |
|
|
|a Incluye referencias bibliográficas e índice.
|
505 |
0 |
|
|a 1.
|t What is combinatorics? --
|g Pt. I.
|t The basic tools of combinatorics --
|t Basic counting rules --
|t Introduction to graph theory --
|t Relations --
|g Pt. II.
|t The counting problem --
|t Generating functions and their applications --
|t Recurrence relations --
|t The principle of inclusion and exclusion --
|t The Polya theory of counting --
|g Pt. III.
|t The existence problem --
|t Combinatorial designs --
|t Coding theory --
|t Existence problems in graph theory --
|g Pt. IV
|t Combinatorial optimization --
|t Matching and covering --
|t Optimization problems for graphs and networks
|
520 |
|
|
|a 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.
|
538 |
|
|
|a Miguel Ángel Gutiérrez Andrade (15157) / Departamento de Ingeniería Eléctrica / CBI, (Sol 081_2010) / Presupuesto Biblioteca 156.02.01.92 / IBI20100130 / ICL20100130 / COBI, Fac. No.22160, $1,458.57, W277477
|
650 |
|
0 |
|a Combinatorial analysis.
|
650 |
|
4 |
|a Análisis combinatorio
|
700 |
1 |
|
|a Tesman, Barry
|
905 |
|
|
|a LIBROS
|
938 |
|
|
|a Miguel Ángel Gutiérrez Andrade (15157)
|b Departamento de Ingeniería Eléctrica
|c CBI, (Sol 081_2010)
|d Presupuesto Biblioteca 156.02.01.92
|e ICL20100130
|f IBI20100130
|
949 |
|
|
|a Biblioteca UAM Iztapalapa
|b Colección General
|c QA164 R6.22 2009
|