TY  - BOOK
AU  - Cormen,Thomas H.
AU  - Leiserson,Charles Eric
AU  - Rivest,Ronald L.
AU  - Stein,Clifford
TI  - Introduction to algorithms
SN  - 9780262046305
U1  - 005.1 
PY  - 2022///
CY  - Cambridge
PB  - The MIT Press
KW  - Algorithms
KW  - Computer algorithms
KW  - Computer programming
N1  - Includes bibliographical references and index
N2  - A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout, with new chapters on matchings in bipartite graphs, online algorithms, and machine learning, and new material on such topics as solving recurrence equations, hash tables, potential functions, and suffix arrays
ER  -