Combinatorial Algorithms: Enlarged Second Edition, Edition 2

·
· Courier Corporation
4.0
2 reviews
Ebook
368
Pages

About this ebook

Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.
Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9 shows how to mix known algorithms and create new ones, while Chapter 10 presents the "Chop-Sticks" algorithm, used to obtain all minimum cuts in an undirected network without applying traditional maximum flow techniques. This algorithm has led to the new mathematical specialty of network algebra. The text assumes no background in linear programming or advanced data structure, and most of the material is suitable for undergraduates. 153 black-and-white illus. 23 tables. Exercises, with answers at the ends of chapters.

Ratings and reviews

4.0
2 reviews

Rate this ebook

Tell us what you think.

Reading information

Smartphones and tablets
Install the Google Play Books app for Android and iPad/iPhone. It syncs automatically with your account and allows you to read online or offline wherever you are.
Laptops and computers
You can listen to audiobooks purchased on Google Play using your computer's web browser.
eReaders and other devices
To read on e-ink devices like Kobo eReaders, you'll need to download a file and transfer it to your device. Follow the detailed Help Center instructions to transfer the files to supported eReaders.