Handbook of Discrete and Combinatorial Mathematics

by Kenneth H. Rosen (Editor)

Overview

Handbook of Discrete and Combinatorial Mathematics provides a comprehensive reference volume for mathematicians, computer scientists, engineers, as well as students and reference librarians.

The material is presented so that key information can be located and used quickly and easily. Each chapter includes a glossary. Individual topics are covered in sections and subsections within chapters, each of which is organized into clearly identifiable parts: definitions, facts, and examples.

Examples are provided to illustrate some of the key definitions, facts, and algorithms. Some curious and entertaining facts and puzzles are also included. Readers will also find an extensive collection of biographies.

This second edition is a major revision. It includes extensive additions and updates. Since the first edition appeared in 1999, many new discoveries have been made and new areas have grown in importance, which are covered in this edition.

Product Details

ISBN-13:	9781584887805
Publisher:	Taylor & Francis
Publication date:	12/01/2017
Series:	Discrete Mathematics and Its Applications
Edition description:	Revised
Pages:	1612
Product dimensions:	7.00(w) x 10.00(h) x (d)

About the Author

Kenneth H. Rosen holds a B.S. from the Univ. of Michigan and a PhD from MIT. Rosen has published many research papers on number theory and mathematical modeling. He is the author of Discrete Mathematics and its Applications, 8^th ed, used extensively worldwide, a leading number theory text, and several books on UNIX. He has held positions at four universities and continues to teach. Rosen spent 22 years at AT&T Bell Labs, as a distinguished member of the technical staff. At Bell Labs he worked on a wide range of projects relating to computing and telecommunications, which led to 70 patents.He is an associate editor of the journal Discrete Mathematics.

Douglas R. Shier is Emeritus Professor in the Department of Mathematical Sciences, Clemson University. His research has been in mathematical and statistical modeling, algorithm development, and networks. He has served as Associate Editor for several journals in Operations Research and is currently Editor-in-Chief of the international journal Networks. He has published over 100 articles, appearing in journals in the areas of environmental and health sciences, operations research, statistics, and computer science. He has authored the books Network Reliability and Algebraic Structures and Puzzles, Paradoxes, and Problem Solving; as well he has co-edited the volumes Applied Mathematical Modeling and the first edition of the CRC Handbook of Discrete and Applied Mathematics.

Wayne Goddard is from Durban, South Africa and completed his graduate studies at the University of Natal and the Massachusetts Institute of Technology. He currently teaches at Clemson University with a joint appointment in the School of Computing and the Department of Mathematical Sciences. He has published over a hundred papers in multiple areas of graph theory and combinatorics, but also has research interests in distibuted algorithms and game-playing. He is author of the textbooks Introducing the Theory of Computation and Research Methodology: An Introduction, and serves as managing editor of the journal Discrete Mathematics.

Table of Contents

Foundations. Counting Methods. Sequences. Number Theory. Algebraic Structures. Linear Algebra. Discrete Probability. Graph Theory. Trees. Networks and Flows. Partially Ordered Sets. Combinatorial Designs. Discrete and Computational Geometry. Coding Theory and Cryptology. Discrete Optimization. Theoretical Computer Science. Information Structures. Data Mining. Bioinformatics.

Editorial Reviews

A reference to all the important areas of discrete mathematics, including those essential to its applications in computer science and engineering. The topics include logic and foundations, number theory, discrete probability, networks and optimization, combinatorial designs, and computational geometry. Among the features are glossaries, lists of important theorems and formulas, examples illustrating terms and concepts, descriptions of algorithms, summary tables, pointers to print and non-print resources, and biographical sketches of important figures. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Booknews