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.

*"synopsis" may belong to another edition of this title.*

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

*"About this title" may belong to another edition of this title.*

US$ 19.90

**Shipping:**
FREE

From United Kingdom to U.S.A.

Published by
Dover Publications Inc., United States
(2010)

ISBN 10: 0486691152
ISBN 13: 9780486691152

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **Dover Publications Inc., United States, 2010. Paperback. Condition: New. New edition. Language: English. Brand new Book. 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. Seller Inventory # FLT9780486691152

Published by
Dover Publications Inc., United States
(2010)

ISBN 10: 0486691152
ISBN 13: 9780486691152

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **Dover Publications Inc., United States, 2010. Paperback. Condition: New. New edition. Language: English. Brand new Book. 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. Seller Inventory # FLT9780486691152

Published by
Dover Publications
(2010)

ISBN 10: 0486691152
ISBN 13: 9780486691152

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **Dover Publications, 2010. Paperback. Condition: New. Seller Inventory # DADAX0486691152

Published by
Dover Publications
(2000)

ISBN 10: 0486691152
ISBN 13: 9780486691152

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **Dover Publications, 2000. Paperback. Condition: New. Dispatched, from the UK, within 48 hours of ordering. This book is in Brand New condition. Seller Inventory # CHL5766371

Published by
Dover Publications
(2010)

ISBN 10: 0486691152
ISBN 13: 9780486691152

New
Softcover
Quantity Available: 1

Seller:

Rating

**Book Description **Dover Publications, 2010. Condition: New. book. Seller Inventory # M0486691152

Published by
Dover Publications

ISBN 10: 0486691152
ISBN 13: 9780486691152

New
PAPERBACK
Quantity Available: 1

Seller:

Rating

**Book Description **Dover Publications. PAPERBACK. Condition: New. 0486691152 New Condition. Seller Inventory # NEW33.1743901

Published by
Dover Pubns
(1996)

ISBN 10: 0486691152
ISBN 13: 9780486691152

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **Dover Pubns, 1996. Paperback. Condition: Brand New. 236 pages. 9.25x6.75x0.50 inches. In Stock. Seller Inventory # 0486691152

ISBN 10: 0486691152
ISBN 13: 9780486691152

New
Quantity Available: 1

Seller:

Rating

**Book Description **Condition: New. New. Seller Inventory # S-0486691152

ISBN 10: 0486691152
ISBN 13: 9780486691152

New
Quantity Available: 1

Seller:

Rating

**Book Description **Condition: New. New. Seller Inventory # M-0486691152