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 (edition Second Edition, Enlarged), 2002

About this Item

Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported.

Seller Inventory # 0486419622-11-1

Bibliographic Details

• Title: Combinatorial Algorithms: Enlarged Second Edition (Dover Books on Computer Science)
• Publisher: Dover Publications (edition Second Edition, Enlarged)
• Publication Date: 2002
• Language: English
• ISBN 10: 0486419622
• ISBN 13: 9780486419626
• Binding: Paperback
• Edition: Second Edition, Enlarged.
• Condition: Good

About this title

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.