Introductory Discrete Mathematics

V. K. Balakrishnan

ISBN 10: 0486691152 / ISBN 13: 9780486691152

Editore: Dover Publications Inc., US, 2000

Riguardo questo articolo

This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. Geared toward mathematics and computer science majors, it emphasizes applications, offering more than 200 exercises to help students test their grasp of the material and providing answers to selected exercises. 1991 edition.

Codice articolo LU-9780486691152

Dati bibliografici

• Titolo: Introductory Discrete Mathematics
• Editore: Dover Publications Inc., US
• Data di pubblicazione: 2000
• Lingua: Inglese
• ISBN 10: 0486691152
• ISBN 13: 9780486691152
• Rilegatura: Paperback
• Condizione: New
• Peso: 386 grammi

Descrizione articolo

Riassunto

This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics. The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems.
Chapters 0&;3 cover fundamental operations involving sets and the principle of mathematical induction, and standard combinatorial topics: basic counting principles, permutations, combinations, the inclusion-exclusion principle, generating functions, recurrence relations, and an introduction to the analysis of algorithms. Applications are emphasized wherever possible and more than 200 exercises at the ends of these chapters help students test their grasp of the material.
Chapters 4 and 5 survey graphs and digraphs, including their connectedness properties, applications of graph coloring, and more, with stress on applications to coding and other related problems. Two important problems in network optimization &; the minimal spanning tree problem and the shortest distance problem &; are covered in the last two chapters. A very brief nontechnical exposition of the theory of computational complexity and NP-completeness is outlined in the appendix.

Informazioni sull?autore

V. K. Balakrishnan is Professor Emeritus at the University of Maine.