Applied Combinatorics

Fred Roberts, Barry Tesman

825 pages, parution le 08/10/2004 (2^eme édition)

Ajouter à une liste

Indisponible

Résumé

For courses in undergraduate Combinatorics for juniors or seniors.

This carefully crafted text emphasizes applications and problem solving. It is divided into 4 parts. Part I introduces basic tools of combinatorics, Part II discusses advanced tools, Part III covers the existence problem, and Part IV deals with combinatorial optimization.

NEW - Many new detailed applications are covered-Including material on the mathematics of SARS, list colorings, expanding discussion of scheduling legislative committees, material on DNA sequence alignment, cryptography, mathematical chemistry, data mining, computational molecular biology, and psychophysical scaling.
• Helps students to see the practical applications of combinatorics to multiple disciplines.
NEW - Section dealing with stable marriages and their many modern applications-Including the assignment of interns to hospitals, dynamic labor markets, and strategic behavior.
• A useful application.
NEW - Expanded coverage of graph theory.
• Enriches the study of combinatorics.
Many topics are presented, first, in easy form, and then, in a more advanced manner-Makes it possible to use this book in a variety of courses.
• Gives students a comprehensive introduction to combinatorics.
Treatment of applications as major topics of their own-Rather than as isolated examples.
• Provides a more integrated and unified presentation of applications.
Current literature and modern literature citations are included.
• Provides students with a contemporary literary context.
Problem-solving through a variety of exercises-Tests routine ideas, introduces new concepts and applications, and attempts to challenge the reader to use the combinatorial techniques developed.
• Encourages students to learn by doing instead of memorizing theory.

L'auteur - Fred Roberts

Fred Roberts, Rutgers University

L'auteur - Barry Tesman

Barry Tesman, Dickinson College

Sommaire

What Is Combinatorics?
Basic Counting Rules.
Introduction to Graph Theory.
Generating Functions and Their Applications.
Recurrence Relations.
The Principle of Inclusion and Exclusion.
The Polya Theory of Counting.
Experimental Design.
Coding Theory.
Existence Problems in Graph Theory.
Matching and Covering.
Optimization Problems for Graphs and Networks.

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Pearson, Prentice Hall
Auteur(s)	Fred Roberts, Barry Tesman
Parution	08/10/2004
Édition	2^eme édition
Nb. de pages	825
Format	18 x 24
Couverture	Relié
Poids	1365g
Intérieur	Noir et Blanc
EAN13	9780130796035
ISBN13	978-0-13-079603-5