Brassard, Gilles
Fundamentals of algorithmics
- Englewood Cliffs : [S.n.], c1996
- xiii, 523 p. ; 23 cm.
Incluye problemas, referencias y lecturas recomendadas. --
1- Preliminaries -- 2- Elementary algorithmics 3- Asymptotic notation 4- Analysis of algorithms 5- Some data structures 6- Greedy algorithms 7- Divide-and-conquer 8- Dynamic programming 9- Exploring graphs 10- Probabilistic algorithms 11- Parallel algorithms 12- Computational complexity 13- Heuristic and approximate algorithms -- References (p. 501-515) -- Index.
0133350681
DIF-M202
ANÁLISIS DE ALGORITMOS