Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications) 1st Edition

3.9 out of 5 stars 8 ratings
ISBN-13: 978-0849339882
ISBN-10: 084933988X
Why is ISBN important?
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Have one to sell?
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.
Due Date: Aug 10, 2021 Rental Details
  • FREE return shipping at the end of the semester.
  • Access codes and supplements are not guaranteed with rentals.
In Stock. Rented from RentU , Fulfilled by Amazon
  • List Price: $160.00
  • Save:$121.50(76%)
FREE delivery: Friday, May 14 Details
In Stock.
Ships from and sold by
Available at a lower price from other sellers that may not offer free Prime shipping.
List Price: $160.00 Details
Save: $104.20 (65%)
12 new from $55.80
FREE delivery: Thursday, May 13 Details
Fastest delivery: Tuesday, May 11
Order within 2 hrs and 35 mins
Combinatorial Algorithms:... has been added to your Cart
Available at a lower price from other sellers that may not offer free Prime shipping.

Celebrity picks - see what your favorite authors are reading

Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone
    Windows Phone
  • Click here to download from Amazon appstore

To get the free app, enter your mobile phone number.


Special offers and product promotions

Editorial Reviews


"Very clear exposition. I jumped right into [the] heuristic methods chapter and understood it almost instantly..."
- Dean H. Judson, Ph.D., Nevada State Demographer

"…book serves as an introduction to the basic problems and methods…style is clear, transparent…The algorithmic problems are always considered and they are in the center of the discussion…has a fresh approach to combinatorics that is available for readers, students in computer science, electrical engineering without any background in mathematics."
- Péter Hajnal, Acta Science Math

About the Author

Kreher, Donald L.; Stinson, Douglas R.
Go ahead, give a gift card

Product details

  • Publisher : CRC Press; 1st edition (December 18, 1998)
  • Language : English
  • Hardcover : 344 pages
  • ISBN-10 : 084933988X
  • ISBN-13 : 978-0849339882
  • Item Weight : 1.4 pounds
  • Dimensions : 6.14 x 0.81 x 9.21 inches
  • Customer Reviews:
    3.9 out of 5 stars 8 ratings

Customer reviews

3.9 out of 5 stars
3.9 out of 5
8 global ratings
5 star
4 star 0% (0%) 0%
3 star 0% (0%) 0%
2 star
1 star
How are ratings calculated?

Top reviews from the United States

Reviewed in the United States on April 3, 2018
Verified Purchase
One person found this helpful
Report abuse
Reviewed in the United States on September 15, 2020