University of Konstanz
Algorithmics Group
Prof. Dr. Ulrik Brandes

Network Analysis (SS 2016)

Announcements

teaching evaluation report

Networks have become omnipresent. Besides physical networks as, e.g., in electrical engineering or transportation systems, abstract networks such as the structure of the WWW or constellations of political actors are increasingly analysed. Due to the variety of applications and resulting research questions, a wide range of methods is applied leading to interesting coherences between graph theory, linear algebra and probabilistic methods. In this course, some of the used methods and their theoretical foundations are presented. While research questions will be motivated by examples of application, the focus, however, will be on algorithmic approaches to these problems as well as their assumptions and characteristics. Moreover, we will come across a number of open questions that invite to further work on this topic.

General Information

Lecture (U. Brandes, T. Shafie) Wed 10:00 - 11:30 (D 436)
Thu 10:00 - 11:30 (D 436)
Tutorial (T. Shafie, D. Schoch) Mon 17:00 - 18:30 (E 403)
Oral Exam 1st date: July 21
2nd date: TBA

Please register for this course in the StudIS and LSF.

Homework Assignments

Normally, the assignments are made available on this webpage as a PDF-file (in English) every Thursday at 14:00.

The editing time for each homework is one week. It is due on the next Thursday at 14:00. The assignments have to be delivered in written form in English and have to be submitted electronically to the corresponding teaching assistants (as one PDF only). Please follow the naming scheme uXX_name1_name2.pdf, where XX indicates the number of the assignment. We will return the corrected and scored assignments in the tutorial. Whatever is not picked up can be retrieved from the corresponding teaching assistant (PZ1007).

The requirements for the admittance to the final exam are 50 percent of the total score of the assignments, regular attendance at the tutorials, and the presentation of at least two of your solutions of the assignments. In writing up your assignments, be as clear, precise, and concise as possible. Understandability will be an important factor in the scoring of the assignments. There will be approximately twelve written assignments. Regular attendance is considered especially for borderline cases.

You are permitted and encouraged to work in groups of two.

No. Posted Due Date Tutorial Download Tutor Additional Material
00 18.04.2016 Intro to Graph Theory David Slides
01 14.04.2016 21.04.2016 25.04.2016 Assignment 1 David
02 21.04.2016 28.04.2016 02.05.2016 Assignment 2 David
03 28.04.2016 05.05.2016 09.05.2016 Assignment 3 David
04 05.05.2016 12.05.2016 23.05.2016 Assignment 4 David
05 12.05.2016 19.05.2016 23.05.2016 Assignment 5 David
06 19.05.2016 26.05.2016 30.05.2016 Assignment 6 David
07 26.05.2016 02.06.2016 06.06.2016 Assignment 7 David
08 02.06.2016 09.06.2016 13.06.2016 Assignment 8 David
09 09.06.2016 16.06.2016 20.06.2016 Assignment 9 David
10 16.06.2016 23.06.2016 27.06.2016 Assignment 10 David
11 23.06.2016 30.06.2016 04.07.2016 Assignment 11 David
12 30.06.2016 07.06.2016 11.07.2016 Assignment 12 David

Course Notes and Supplemental Material

Non-public material is accessible only from local machines (IP 134.34.*.*) or via VPN.

  • Lecture notes of the previous edition of this course. Note that the content is revised again this year.
  • Revised lecture notes for this edition. We attempt to provide updates in a timely manner.
  • Friendship Paradox
  • Textbooks

    Further Information (in German)