Combinatorial Algorithms
(eBook)
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.
Notes
Hu, T. C. (2012). Combinatorial Algorithms. [United States], Dover Publications.
Chicago / Turabian - Author Date Citation (style guide)Hu, T. C.. 2012. Combinatorial Algorithms. [United States], Dover Publications.
Chicago / Turabian - Humanities Citation (style guide)Hu, T. C., Combinatorial Algorithms. [United States], Dover Publications, 2012.
MLA Citation (style guide)Hu, T. C.. Combinatorial Algorithms. [United States], Dover Publications, 2012.
Hoopla Extract Information
| hooplaId | 11605625 |
|---|---|
| title | Combinatorial Algorithms |
| kind | EBOOK |
| price | 1.69 |
| active | 1 |
| pa | 0 |
| profanity | 0 |
| children | 0 |
| demo | 0 |
| rating | |
| abridged | 0 |
| dateLastUpdated | Sep 14, 2022 08:37:53 PM |
Record Information
| Last File Modification Time | Nov 22, 2023 11:28:56 PM |
|---|---|
| Last Grouped Work Modification Time | Jan 26, 2024 03:04:47 PM |
MARC Record
| LEADER | 02502nam a22003735a 4500 | ||
|---|---|---|---|
| 001 | MWT11605625 | ||
| 003 | MWT | ||
| 005 | 20231027102145.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 231027s2012 xxu eo 000 0 eng d | ||
| 020 | |a 9780486152943|q (electronic bk.) | ||
| 020 | |a 0486152944|q (electronic bk.) | ||
| 028 | 4 | 2 | |a MWT11605625 |
| 029 | |a https://d2snwnmzyr8jue.cloudfront.net/csp_9780486152943_180.jpeg | ||
| 037 | |a 11605625|b Midwest Tape, LLC|n http://www.midwesttapes.com | ||
| 040 | |a Midwest|e rda | ||
| 099 | |a eBook hoopla | ||
| 100 | 1 | |a Hu, T. C.,|e author. | |
| 245 | 1 | 0 | |a Combinatorial Algorithms|h [electronic resource] /|c M. T. Shing and T. C. Hu. |
| 264 | 1 | |a [United States] :|b Dover Publications,|c 2012. | |
| 264 | 2 | |b Made available through hoopla | |
| 300 | |a 1 online resource (368 pages) | ||
| 336 | |a text|b txt|2 rdacontent | ||
| 337 | |a computer|b c|2 rdamedia | ||
| 338 | |a online resource|b cr|2 rdacarrier | ||
| 347 | |a text file|2 rda | ||
| 506 | |a Instant title available through hoopla. | ||
| 520 | |a 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. | ||
| 538 | |a Mode of access: World Wide Web. | ||
| 650 | 0 | |a Electronic books. | |
| 710 | 2 | |a hoopla digital. | |
| 856 | 4 | 0 | |u https://www.hoopladigital.com/title/11605625?utm_source=MARC&Lid=hh4435|z Instantly available on hoopla. |
| 856 | 4 | 2 | |z Cover image|u https://d2snwnmzyr8jue.cloudfront.net/csp_9780486152943_180.jpeg |
