Combinatorial Algorithms

Enlarged Second Edition

Nonfiction, Science & Nature, Mathematics, Combinatorics
Cover of the book Combinatorial Algorithms by M. T. Shing, T. C. Hu, Dover Publications
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: M. T. Shing, T. C. Hu ISBN: 9780486152943
Publisher: Dover Publications Publication: April 26, 2012
Imprint: Dover Publications Language: English
Author: M. T. Shing, T. C. Hu
ISBN: 9780486152943
Publisher: Dover Publications
Publication: April 26, 2012
Imprint: Dover Publications
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Dover Publications

Cover of the book G. K. Chesterton Quotes by M. T. Shing, T. C. Hu
Cover of the book The Adventures of Old Mr. Buzzard by M. T. Shing, T. C. Hu
Cover of the book The Decameron by M. T. Shing, T. C. Hu
Cover of the book Differential Equations for Engineers and Scientists by M. T. Shing, T. C. Hu
Cover of the book Line by M. T. Shing, T. C. Hu
Cover of the book The English and Scottish Popular Ballads, Vol. 1 by M. T. Shing, T. C. Hu
Cover of the book Fancy Dresses Described by M. T. Shing, T. C. Hu
Cover of the book Four Great Tragedies by M. T. Shing, T. C. Hu
Cover of the book Views of Mt. Fuji by M. T. Shing, T. C. Hu
Cover of the book The Settlement Cook Book 1903 by M. T. Shing, T. C. Hu
Cover of the book Stone Painting for Kids by M. T. Shing, T. C. Hu
Cover of the book Timon of Athens by M. T. Shing, T. C. Hu
Cover of the book William Morris Full-Color Patterns and Designs by M. T. Shing, T. C. Hu
Cover of the book Four Great Russian Plays by M. T. Shing, T. C. Hu
Cover of the book The Theory and Practice of the Mandala by M. T. Shing, T. C. Hu
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy