Condition: New.
Published by Dover Publications Inc., New York, 2000
ISBN 10: 0486691152 ISBN 13: 9780486691152
Language: English
Seller: CitiRetail, Stevenage, United Kingdom
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 our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Published by Dover Publications Inc., 2010
ISBN 10: 0486691152 ISBN 13: 9780486691152
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Paperback / softback. Condition: New. New copy - Usually dispatched within 4 working days. 388.
Published by Dover Publications Inc., 2000
ISBN 10: 0486691152 ISBN 13: 9780486691152
Language: English
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Published by Dover Publications, Incorporated, 2010
ISBN 10: 0486691152 ISBN 13: 9780486691152
Language: English
Seller: Better World Books, Mishawaka, IN, U.S.A.
£ 11.60
Convert currencyQuantity: 1 available
Add to basketCondition: Good. Used book that is in clean, average condition without any missing pages.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In.
Condition: As New. Unread book in perfect condition.
Published by Dover Publications Inc., US, 2000
ISBN 10: 0486691152 ISBN 13: 9780486691152
Language: English
Seller: Rarewaves.com UK, London, United Kingdom
Paperback. Condition: New. 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.
Published by Dover Publications, Incorporated, 2010
ISBN 10: 0486691152 ISBN 13: 9780486691152
Language: English
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. pp. 256.
Published by Dover Publications Inc., 1996
ISBN 10: 0486691152 ISBN 13: 9780486691152
Language: English
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
£ 18.63
Convert currencyQuantity: 2 available
Add to basketCondition: New. Series: Dover Books on Computer Science. Num Pages: 256 pages, 65ill. BIC Classification: PDE; TBJ. Category: (G) General (US: Trade). Dimension: 160 x 236 x 15. Weight in Grams: 364. . 2010. Paperback. . . . .
Published by Dover Publications Inc., 2010
ISBN 10: 0486691152 ISBN 13: 9780486691152
Language: English
Seller: Kennys Bookstore, Olney, MD, U.S.A.
£ 21.41
Convert currencyQuantity: 2 available
Add to basketCondition: New. Series: Dover Books on Computer Science. Num Pages: 256 pages, 65ill. BIC Classification: PDE; TBJ. Category: (G) General (US: Trade). Dimension: 160 x 236 x 15. Weight in Grams: 364. . 2010. Paperback. . . . . Books ship from the US and Ireland.
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 236 pages. 9.25x6.75x0.50 inches. In Stock.
Published by Dover Publications, Incorporated, 2010
ISBN 10: 0486691152 ISBN 13: 9780486691152
Language: English
Seller: Books Puddle, New York, NY, U.S.A.
£ 19.24
Convert currencyQuantity: 10 available
Add to basketCondition: New. pp. 256.
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 236 pages. 9.25x6.75x0.50 inches. In Stock.
Published by Dover Publications, Incorporated, 2010
ISBN 10: 0486691152 ISBN 13: 9780486691152
Language: English
Seller: Biblios, Frankfurt am main, HESSE, Germany
£ 19.77
Convert currencyQuantity: 10 available
Add to basketCondition: New. pp. 256.
£ 14.60
Convert currencyQuantity: 3 available
Add to basketCondition: As New. Unread book in perfect condition.
Published by Dover Publications Okt 2010, 2010
ISBN 10: 0486691152 ISBN 13: 9780486691152
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
£ 19.18
Convert currencyQuantity: 1 available
Add to basketTaschenbuch. Condition: Neu. Neuware - 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.
£ 17.28
Convert currencyQuantity: 3 available
Add to basketCondition: New.
£ 21.44
Convert currencyQuantity: 1 available
Add to basketCondition: Very Good. Very Good condition. A copy that may have a few cosmetic defects. May also contain light spine creasing or a few markings such as an owner's name, short gifter's inscription or light stamp.
£ 15.38
Convert currencyQuantity: 1 available
Add to basketPaperback. Condition: New.
£ 12.31
Convert currencyQuantity: 3 available
Add to basketSoftcover. Condition: New. Special order direct from the distributor.
£ 20.56
Convert currencyQuantity: 2 available
Add to basketCondition: New. Über den AutorV. K. Balakrishnan is Professor Emeritus at the University of Maine.KlappentextThis concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standar.
Seller: Off The Shelf, Antonia, MO, U.S.A.
£ 8.52
Convert currencyQuantity: 1 available
Add to basketCondition: Good. The item shows wear from consistent use, but it remains in good condition and works perfectly. All pages and cover are intact (including the dust cover, if applicable). Spine may show signs of wear. Pages may include limited notes and highlighting. May NOT include discs, access code or other supplemental materials.
Published by Dover Publications Inc., US, 2000
ISBN 10: 0486691152 ISBN 13: 9780486691152
Language: English
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Paperback. Condition: New. 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.
Published by Dover Publications Inc., New York, 2000
ISBN 10: 0486691152 ISBN 13: 9780486691152
Language: English
Seller: Grand Eagle Retail, Mason, OH, U.S.A.
£ 16.91
Convert currencyQuantity: 1 available
Add to basketPaperback. 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.
Published by Dover Publications Inc., New York, 2000
ISBN 10: 0486691152 ISBN 13: 9780486691152
Language: English
Seller: AussieBookSeller, Truganina, VIC, Australia
£ 30.24
Convert currencyQuantity: 1 available
Add to basketPaperback. 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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
£ 13.60
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. Brand New.
Published by Pearson Education (Us), 1990
ISBN 10: 0134786785 ISBN 13: 9780134786780
Language: English
Seller: Anybook.com, Lincoln, United Kingdom
Condition: Poor. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. Book contains pen & pencil markings. In poor condition, suitable as a reading copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,500grams, ISBN:0134786785.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
£ 12.65
Convert currencyQuantity: 1 available
Add to basketCondition: New.
Published by Pearson Education (Us), 1990
ISBN 10: 0134786785 ISBN 13: 9780134786780
Language: English
Seller: Anybook.com, Lincoln, United Kingdom
Condition: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. Clean from markings. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,500grams, ISBN:0134786785.