Combinatorial Algorithms: Enlarged Second Edition (Dover Books on Computer Science)
Hu, T. C.; Shing, M. T.
ISBN 10: 0486419622 ISBN 13: 9780486419626
Published by Dover Publications, 2002
Used
Soft cover
From
Greenworld Books, Arlington, TX, U.S.A.
Seller rating 5 out of 5 stars
AbeBooks Seller since June 20, 2025
This specific item is no longer available.
About this Item
Description:
Fast Free Shipping â Good condition. It may show normal signs of use, such as light writing, highlighting, or library markings, but all pages are intact and the book is fully readable. A solid, complete copy that's ready to enjoy. Seller Inventory # GWV.0486419622.G
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.
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.
"About this title" may belong to another edition of this title.
Bibliographic Details
Title: Combinatorial Algorithms: Enlarged Second ...
Publisher: Dover Publications
Publication Date: 2002
Binding: Soft cover
Condition: good
Edition: 2nd Edition