Instructor: Prof. João Meidanis (see footer for email)
Overview
This is a course on Graph Algorithms, with emphasis in Network Science. We will cover a few classic graph algorithms, interspersed with chapters from Barabási's book.
We will have regular, face-to-face lectures this term. In a typical class, the instructor will start by showing a short presentation on the topic of the day, followed by discussions, and usually a review of related exercises from various sources. Students are encouraged to share their views and impressions. Some classes will have special events, such as student presentations, hands-on classes, exams, etc.
We have a lot of ground to cover in one semester. We know that Unicamp students have to deal with a heavy class load. To be able to fulfill your commitments, it is essential to be thoroughly organized. We estimate that a student will have to devote around 12 hours per week to this course, including time for reading, attending classes, and doing assignments.
Office hours: Please schedule an appointment by email.
About me
Back in school, my knack for math and science and my desire to help my peers led me to believe I was destined to be a teacher. Over time, however, I discovered that my true strength lies in one-on-one mentoring. Standing in front of a classroom with a blackboard or slides was a challenge that took some time to master. I’ve always remained curious, and I find that I learn just as much from my students at every level as they do from me. I hope our interaction is just as rewarding for you.
References:
Network Science. Albert-László Barabási. Cambridge University Press, 2016.
Introduction to Algorithms, 4th Edition. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein. The MIT Press, 2009.
Algorithms, 4th Edition. Robert Sedgewick, Kevin Wayne. Addison-Wesley Professional, 2011.