Paperback. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
paperback. Condizione: Near Fine. Condition Notes: Excellent, unmarked copy with little wear and tight binding. We ship in recyclable American-made mailers. 100% money-back guarantee on all orders.
Da: INDOO, Avenel, NJ, U.S.A.
EUR 15,82
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Brand New.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 16,97
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 18,25
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Dover Publications Inc., US, 2000
ISBN 10: 0486691152 ISBN 13: 9780486691152
Da: Rarewaves.com USA, London, LONDO, Regno Unito
EUR 20,60
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: 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.
Lingua: Inglese
Editore: Dover Publications Inc., New York, 2000
ISBN 10: 0486691152 ISBN 13: 9780486691152
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condizione: 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.
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
EUR 18,44
Quantità: 15 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Lingua: Inglese
Editore: Dover Publications, Incorporated, 2010
ISBN 10: 0486691152 ISBN 13: 9780486691152
Da: Majestic Books, Hounslow, Regno Unito
EUR 20,68
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New. pp. 256.
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 20,61
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: 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. . . . .
Da: Revaluation Books, Exeter, Regno Unito
EUR 20,21
Quantità: 3 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 236 pages. 9.25x6.75x0.50 inches. In Stock.
Da: Chiron Media, Wallingford, Regno Unito
EUR 15,42
Quantità: 3 disponibili
Aggiungi al carrellopaperback. Condizione: New.
Da: Kennys Bookstore, Olney, MD, U.S.A.
Condizione: 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.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 19,90
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 16,40
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Dover Publications, Incorporated, 2010
ISBN 10: 0486691152 ISBN 13: 9780486691152
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 256.
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 17,58
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 19,60
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Dover Publications, Incorporated, 2010
ISBN 10: 0486691152 ISBN 13: 9780486691152
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 26,99
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New. pp. 256.
Lingua: Inglese
Editore: Dover Publications Inc., New York, 2000
ISBN 10: 0486691152 ISBN 13: 9780486691152
Da: CitiRetail, Stevenage, Regno Unito
EUR 19,07
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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.
Lingua: Inglese
Editore: Dover Publications, Inc, Garden City, 1996
ISBN 10: 0486691152 ISBN 13: 9780486691152
Da: San Francisco Book Company, Paris, Francia
EUR 20,00
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Very good. Paperback Octavo. wraps, 236 pp Standard shipping (no tracking or insurance) / Priority (with tracking) / Custom quote for large or heavy orders.
Lingua: Inglese
Editore: Dover Publications Inc., New York, 2000
ISBN 10: 0486691152 ISBN 13: 9780486691152
Da: AussieBookSeller, Truganina, VIC, Australia
EUR 36,61
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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.
Da: moluna, Greven, Germania
EUR 23,03
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: 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.
Lingua: Inglese
Editore: Dover Publications Inc. Okt 2010, 2010
ISBN 10: 0486691152 ISBN 13: 9780486691152
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 21,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Lingua: Inglese
Editore: Dover Publications Inc., US, 2000
ISBN 10: 0486691152 ISBN 13: 9780486691152
Da: Rarewaves.com UK, London, Regno Unito
EUR 18,26
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: 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.
Da: preigu, Osnabrück, Germania
EUR 25,25
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Introductory Discrete Mathematics | V. K. Balakrishnan | Taschenbuch | Kartoniert / Broschiert | Englisch | 2000 | Dover Publications Inc. | EAN 9780486691152 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu.
ISBN 10: 0486691152 ISBN 13: 9780486691152
Da: Speedyhen, Hertfordshire, Regno Unito
EUR 16,41
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: NEW.