Combinatorial Algorithms: Enlarged Second Edition
By: and
Sign Up Now!
Already a Member? Log In
You must be logged into Bookshare to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 1982
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9780486152943
- Related ISBNs:
- 9780486419626
- Publisher:
- Dover Publications
- Date of Addition:
- 02/12/18
- Copyrighted By:
- T. C. Hu
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Mathematics and Statistics
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.