Projeto e Análise de Algoritmos

Aula de reposição às 10:30 (21/03/24): meet.google.com/gty-irya-zjx

Projeto Otimiza: (aqui)

Plano de Ensino: (aqui)

Lista: (aqui)

Monitores: Athus Henrique Marinho Vasconcelos (athmv@ic.ufal.br), José Janio Marinho de Castro Junior (jjmc@ic.ufal.br), Matheus Almeida Souza (mats@ic.ufal.br), Pablo Munih Silva de Carvalho (pmsc@ic.ufal.br) e Wellington Cezario dos Santos (wcs@ic.ufal.br).

• 1 AB:
• Notas: (aqui)
• Prova 1: 26/03/26
• Prova 2: 23/04/26
• 2 AB:
• Notas: (aqui)
• Prova 3: 21/05/26
• Prova 4: 25/06/26
• 3 AB: 02/07/26
• Final: 09/07/26

• PAA
• Cormen, T.H., Leiserson, C.E. & Rivest, R.L. & Stein, C. (2009), Introduction to Algorithms, 3rd edition, MIT Press [PAA].
• Dasgupta, S., Papadimitriou, C.H. & Vazirani, U.V. (2006), Algorithms, McGraw-Hill [PAA].
• Ziviani N., Projeto de Algoritmos, Thomson Learning (Versão em qualquer linguagem)[PAA].
• Levitin, Anany. (2012). Introduction to the design & analysis of algorithms, Pearson. [PAA].
• Cormen, T.H. (2012). Algorithms Demystified, MIT Press [PAA].
• Kleinberg J. & Tardos, É. (2005), Algorithm Design, Addison-Wesley [PAA].
• Sedgewick, R. & Wayne,K. (2011), Algorithms, 4th. edition, Addison-Wesley [PAA].
• Sedgewick, R. & Flajolet, P. (2011), An Introduction to the Analysis of Algorithms, 2nd. edition, Addison-Wesley [PAA].
• Skiena, S. (2008), The Algorithm Design Manual, 2nd. edition, Springer [PAA].
• Aho, A.V. & Ullman, J.D. (1997), Foundations of Computer Science (C edition), Computer Science Press [PAA].
• Knuth, D.E. The Art of Computer Programming, Addison-Wesley [PAA].

• Grafos
• Bondy, J.A. & Murty, U.S.R. (1976), Graph Theory With Applications, Elsevier Science Ltd/North-Holland [Teo. dos Grafos].
• Szwarcfiter, J.L. (1988), Grafos e algoritmos computacionais, Rio de Janeiro: Campus [Teo. dos Grafos].
• Boaventura, P. & Jurkiewicz, S. (2009), Grafos: Introdução e Prática, Blucher [Teo. e Alg. em Grafos].
• West, D.B. (1996), Introduction to Graph Theory. Prentice-Hall, New Jersey [Teo. dos Grafos].
• Diestel, R. ,(1997), Graph Theory. Springer, New York [Teo. dos Grafos].
• Ahuja, R.K., Magnanti, T.L. & Orlin, J.B. (1993), Network Flows: Theory, Algorithms, and Applications 1st Edition, Prentice Hall [Alg. em Grafos].
• Scheinerman, E.R. (2011), Mathematics: a discrete introduction 2nd Edition, Brooks Cole [Recorrência e Teo. dos Grafos].

• NP-completude
• Garey, M.R. & Johnson, D.S. (1979), Computers and Intractability: a Guide to the Theory of NP-Completeness, W.H. Freeman [NP-completude].