Introductory Discrete Mathematics (Dover Books on Computer Science) - Softcover

Balakrishnan, V.K.

4

30 ratings by Goodreads

9780486691152: Introductory Discrete Mathematics (Dover Books on Computer Science)

Softcover

ISBN 10: 0486691152 ISBN 13: 9780486691152

Publisher: Dover Publications Inc., 1996

View all copies of this ISBN edition:

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.

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

About the Author:

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

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

PublisherDover Publications Inc.
Publication date1996
ISBN 10 0486691152
ISBN 13 9780486691152
BindingPaperback
Number of pages256
Rating
- 4
  
  30 ratings by Goodreads

Buy New

Learn more about this copy

� 10.09

Convert currency

Shipping: � 3.17
Within U.S.A.

Destination, rates & speeds

Add to Basket

Other Popular Editions of the Same Title

9780130399427: Introductory Discrete Mathematics

Featured Edition

ISBN 10: 0130399426 ISBN 13: 9780130399427
Publisher: Pearson Education (US), 1991
Hardcover

Pearso..., 1990
Softcover

Top Search Results from the AbeBooks Marketplace

Stock Image

Introductory Discrete Mathematics Format: Paperback

Balakrishnan, V. K .

Published by Dover Publishers (2010)

ISBN 10: 0486691152 ISBN 13: 9780486691152

New Softcover Quantity: > 20

Seller:

INDOO
(Avenel, NJ, U.S.A.)

Rating

Seller Rating:

Book Description Condition: New. Brand New. Seller Inventory # 9780486691152

More information about this seller | Contact seller

Buy New

� 10.09

Convert currency

Add to Basket

Shipping: � 3.17

Within U.S.A.

Destination, rates & speeds

Stock Image

Introductory Discrete Mathematics (Dover Books on Computer Science)

Balakrishnan, V. K .

Published by Dover Publications (2010)

ISBN 10: 0486691152 ISBN 13: 9780486691152

New Softcover Quantity: 1

Seller:

GF Books, Inc.
(Hawthorne, CA, U.S.A.)

Rating

Seller Rating:

Book Description Condition: New. Book is in NEW condition. 0.7. Seller Inventory # 0486691152-2-1

More information about this seller | Contact seller

Buy New

� 16.48

Convert currency

Add to Basket

Shipping: FREE

Within U.S.A.

Destination, rates & speeds

Stock Image

Introductory Discrete Mathematics (Dover Books on Computer Science)

Balakrishnan, V. K .

Published by Dover Publications (2010)

ISBN 10: 0486691152 ISBN 13: 9780486691152

New Softcover Quantity: 1

Seller:

Book Deals
(Tucson, AZ, U.S.A.)

Rating

Seller Rating:

Book Description Condition: New. New! This book is in the same immaculate condition as when it was published 0.7. Seller Inventory # 353-0486691152-new

More information about this seller | Contact seller

Buy New

� 16.49

Convert currency

Add to Basket

Shipping: FREE

Within U.S.A.

Destination, rates & speeds

Seller Image

Introductory Discrete Mathematics (Paperback)

V.K. Balakrishnan

Published by Dover Publications Inc., New York (2000)

ISBN 10: 0486691152 ISBN 13: 9780486691152

New Paperback Quantity: 1

Seller:

Grand Eagle Retail
(Wilmington, DE, U.S.A.)

Rating

Seller Rating:

Book Description Paperback. Condition: new. Paperback. 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 colouring, 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. This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. More than 200 exercises, many with complete solutions. 1991 edition. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780486691152

More information about this seller | Contact seller

Buy New

� 17.65

Convert currency

Add to Basket

Shipping: FREE

Within U.S.A.

Destination, rates & speeds

Stock Image