Profesor | María de Luz Gasca Soto | lu mi vi | 13 a 14 | Taller de Lenguajes de Programación |
Ayudante | Luis Daniel Hernández Sandoval | ma ju | 13 a 14 | Taller de Lenguajes de Programación |
Ayud. Lab. | Rodrígo Ruíz Murguía | vi | 14 a 16 | Taller de Lenguajes de Programación |
AnálisisdeAlgoritmos II
Semestre 2012-II
Profesora: María de Luz Gasca Soto
Temario
Bibliografía
1.Chartran, G. And Oellermann, O.R. Applied and Algorithmic Graph Theory. Mc Graw Hill. USA, 1993.
2.Manber, Udi Introduction to Algorithms. A Creative Approach, Addison Wesley, USA,1989.
3.Cormen, T.H; L.C.E. & R.R.L.Introduction to Algorithms,Addison Wesley, USA,1990
4. Rawlins, G.J.E.Compared to what? An Introduction to the Analysis of Algorithms, Computer Science Press, USA, 1991
5.Neapolitan, R. and Naimipour, K. Foundations of Algorithms. D.C. Heath and Company, USA, 1996.
6.Garey, J. Computer and Intratability: A guide to the TheoryNP-Completness. Freeman, 1979
7.JáJá, J. An Introduction to Parallel Algorithms. Addison Wesley, USA,1992.
8.Sharp, J. A. An Introduction to Distributed and Parallel Algorithms.Oxford, 1987.
9.Chandí, K.M. & M.J.Parallel Program Design, A foundation. Addison Wesley, USA,1988.
10. Gibbons, A. Algorithmic Graph Theory, Cambridge University Press, USA, 1988.