Combinatorial Algorithms: Enlarged Second Edition
Select Format
Select Condition 
Book Overview
Updated second edition presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication,... This description may be from another edition of this product.
Format:Paperback
Language:English
ISBN:0486419622
ISBN13:9780486419626
Release Date:April 2002
Publisher:Dover Publications
Length:354 Pages
Weight:1.15 lbs.
Dimensions:0.8" x 6.6" x 9.3"
Customer Reviews
1 rating
A useful book on combinatorial algorithms
Published by Thriftbooks.com User , 16 years ago
I humbly disagree with the previous review. I think that this is a concise and useful book on combinatorial algorithms. It presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, matrix multiplication, and NP-complete problems. Moreover, answers to the exercises are provided. I think that the authors have done a good job in presenting and discussing the algorithms succinctly.
Copyright © 2024 Thriftbooks.com Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks® and the ThriftBooks® logo are registered trademarks of Thrift Books Global, LLC
ThriftBooks® and the ThriftBooks® logo are registered trademarks of Thrift Books Global, LLC
