IntroductiontoAlgorithms(4/e)

The leading algorithms text has undergone a comprehensive update, now featuring new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.

Introduction to Algorithms stands out from other textbooks on the subject, combining both rigor and comprehensiveness in its coverage of a broad range of algorithms. Its self-contained chapters featuring algorithms in pseudocode make it accessible to readers of all levels. Since its initial publication, this book has become the standard reference for professionals and the leading algorithms text in universities worldwide.

This fourth edition has been updated throughout and boasts several new features. It includes new chapters on matchings in bipartite graphs, online algorithms, and machine learning, as well as additional material covering topics such as solving recurrence equations, hash tables, potential functions, and suffix arrays. The latest edition also offers 140 new exercises and 22 new problems, with improvements to existing problems based on reader feedback.

In addition, the writing style has been enhanced to be more personal, clearer, and gender-neutral. Color has been added to improve visual presentation, and the notes, bibliography, and index have been updated to reflect developments in the field. A new website has been established to provide supplementary material.

作者简介

ThomasH.CormenisEmeritusProfessorofComputerScienceatDartmouthCollege.CharlesE.LeisersonisEdwinSibleyWebsterProfessorinElectricalEngineeringandComputerScienceatMIT.RonaldL.RivestisInstituteProfessoratMIT.CliffordSteinisWaiT.ChangProfessorofIndustrialEngineeringandOperationsResearch,andofComputerScienceatColumbiaUniversity.