Buy used: $10.37
$3.99 delivery February 21 - 22. Details
Used: Very Good | Details
Sold by awesomebooksusa
Condition: Used: Very Good
Comment: This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See more of our deals.
Access codes and supplements are not guaranteed with used items.
Loading your book clubs
There was a problem loading your book clubs. Please try again.
Not in a club? Learn more
Amazon book clubs early access

Join or create book clubs

Choose books together

Track your books
Bring your club to Amazon Book Clubs, start a new book club and invite your friends to join, or find a club that’s right for you for free.
Kindle app logo image

Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.

Read instantly on your browser with Kindle for Web.

Using your mobile phone camera - scan the code below and download the Kindle app.

QR code to download the Kindle App

Follow the author

Something went wrong. Please try your request again later.

Implementing Discrete Mathematics: Combinatorics And Graph Theory With Mathematica First Edition

3.0 3.0 out of 5 stars 2 ratings

This book concentrates on two distinct areas in discrete mathematics. The first section deals with combinatorics, loosely defined as the study of counting. We provide functions for generating combinatorial objects such as permutations, partitions, and Young tableaux, as well as for studying various aspects of these structures.The second section considers graph theory, which can be defined equally loosely as the study of binary relations. We consider a wide variety of graphs, provide functions to create them, and functions to show what special properties they have, Although graphs are combinatorial structures, understanding them requires pictures or embeddings. Thus we provide functions to create a variety of graph embeddings, so the same structure can be viewed in several different ways. Algorithmic graph theory is an important interface between mathematics and computer science, and so we study a variety of polynominal and exponential time problems.

Amazon First Reads | Editors' picks at exclusive prices

Product details

  • Publisher ‏ : ‎ Basic Books; First Edition (January 21, 1990)
  • Language ‏ : ‎ English
  • Hardcover ‏ : ‎ 334 pages
  • ISBN-10 ‏ : ‎ 0201509431
  • ISBN-13 ‏ : ‎ 978-0201509434
  • Item Weight ‏ : ‎ 1.7 pounds
  • Dimensions ‏ : ‎ 8.5 x 0.75 x 9.75 inches
  • Customer Reviews:
    3.0 3.0 out of 5 stars 2 ratings

Important information

To report an issue with this product or seller, click here.

About the author

Follow authors to get new release updates, plus improved recommendations.
Brief content visible, double tap to read full content.
Full content visible, double tap to read brief content.

Steven S. Skiena is Distinguished Teaching Professor of Computer Science at Stony Brook University. He is the author of six well-regarded books: The Algorithm Design Manual (2020), The Data Science Design Manual (2017), Who's Bigger (2013), Calculated Bets: Computers, Gambling, and Mathematical Modeling to Win (2001), Programming Challenges (with Miguel Revilla, 2003) and Computational Discrete Mathematics (with Sriram Pemmaraju, 2003).

Customer reviews

3 out of 5 stars
3 out of 5
2 global ratings

No customer reviews

There are 0 customer reviews and 2 customer ratings.