HomeGroupsTalkZeitgeist
Hide this

Results from Google Books

Click on a thumbnail to go to Google Books.

Combinatorial Algorithms: Generation,…
Loading...

Combinatorial Algorithms: Generation, Enumeration, and Search

by Donald L. Kreher, Douglas R. Stinson

MembersReviewsPopularityAverage ratingConversations
18None561,019 (4)None
None

None.

Loading...

Sign up for LibraryThing to find out whether you'll like this book.

No current Talk conversations about this book.

No reviews
no reviews | add a review

» Add other authors

Author nameRoleType of authorWork?Status
Donald L. Kreherprimary authorall editionsconfirmed
Stinson, Douglas R.main authorall editionsconfirmed
You must log in to edit Common Knowledge data.
For more help see the Common Knowledge help page.
Series (with order)
Canonical title
Original title
Alternative titles
Original publication date
People/Characters
Important places
Important events
Related movies
Awards and honors
Epigraph
Dedication
First words
Quotations
Last words
Disambiguation notice
Publisher's editors
Blurbers
Publisher series
Original language

References to this work on external resources.

Wikipedia in English

None

Book description
Haiku summary

Amazon.com Product Description (ISBN 084933988X, Hardcover)

This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as:
Combinations
Permutations
Graphs
Designs

Many classical areas are covered as well as new research topics not included in most existing texts, such as:
Group algorithms
Graph isomorphism
Hill-climbing
Heuristic search algorithms

This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.

(retrieved from Amazon Mon, 30 Sep 2013 13:31:56 -0400)

No library descriptions found.

Quick Links

Swap Ebooks Audio
1 wanted

Popular covers

Rating

Average: (4)
0.5
1
1.5
2
2.5
3
3.5
4 1
4.5
5

Is this you?

Become a LibraryThing Author.

 

Help/FAQs | About | Privacy/Terms | Blog | Contact | LibraryThing.com | APIs | WikiThing | Common Knowledge | Legacy Libraries | Early Reviewers | 93,329,018 books! | Top bar: Always visible