TY  - BOOK
AU  - Baase,Sara
AU  - 
TI  - Computer algorithms: introduction to design and analysis 
SN  - 0201612445
U1  - 519.7 
PY  - 2000///
CY  - Reading, Mass.
PB  - Addison-Wesley
KW  - Computer algorithms
N1  - Preface. - 1. Analyzing Algorithms and Problems : Principles and Examples. - 2. Data Abstraction and Basic Data Structures. - 3. Recursion and Induction. - 4. Sorting. - 5. Selection and Adversary Arguments. - 6. Dynamic Sets and Searching. - 7. Graphs and Graph Traversals. - 8. Graph Optimization Problems and Greedy Algorithms. - 9. Transitive Closure, All-Pairs Shortest Paths. - 10. Dynamic Programming. - 11. String Matching. - 12. Polynomials and Matrices. - 13. NP-Complete Problems. - 14. Parallel Algorithms. - A. Java Examples and Techniques. - Bibliography. - Index
N2  - This book is intended for an upper-division or graduate course in algorithms. It has sufficient material to allow several choices of topics. The purpose of the book is threefold. It is intended to teach algorithms for solving real problems that arise frequently in computer applications, to teach basic principles and techniques of computational complexity (worst-case and average behaviour, space usage, and lower bounds on the complexity of a problem), and to introduce the areas of NP-completeness and parallel algorithms. - Preface
ER  -