Isbn: 9780486691152 - introductory discrete mathematics (34 risultati)

Condizione: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.

Paperback. Condizione: Good. 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.…

Condizione: very_good. Used - Very Good: Item may have minor cosmetic defects.

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: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

Paperback. Condizione: Very Good. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Paperback. Condizione: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority.

Condizione: acceptable.

Condizione: New. Brand New.

paperback. Condizione: New. Brand new book, sourced directly from publisher. Dispatch time is 24-48 hours from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Paperback. 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.…

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.…

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condizione: Brand New. 236 pages. 9.25x6.75x0.50 inches. In Stock.

Condizione: New. In English.

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. . . . .

Condizione: New.

Paperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days.

Condizione: New. pp. 256.

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.

Condizione: As New. Unread book in perfect condition.

Paperback. Condizione: Brand New. 236 pages. 9.25x6.75x0.50 inches. In Stock.

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 our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

Paperback. Condizione: Very good. Paperback Octavo. wraps, 236 pp Standard shipping (no tracking or insurance) / Priority (with tracking) / Custom quote for large or heavy orders.

Taschenbuch. 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.

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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

Condizione: New. &Uumlber 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.

Paperback. 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.…