University of Konstanz
Algorithmics Group
Prof. Dr. Ulrik Brandes

Network Analysis (SS 2017)


First Assignments: 27 Apr

First Tutorial: 08 May

Teaching evaluation results

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) Wed 10:00 - 11:30 (D 436)
Thu 13:30 - 15:00 (D 436)
Tutorial (D. Schoch) Mon 17:00 - 18:30 (E 403)
Oral Exam 1st date: August 8+9, 2017
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 16:00.

The editing time for each homework is one week. It is due on the next Thursday at 16: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 Intro to Graph Theory
01 27.04.2017 04.05.2017 08.05.2017 Assignment 1 David
02 04.05.2017 11.05.2017 15.05.2017 Assignment 2 David
03 11.05.2017 18.05.2017 22.05.2017 Assignment 3 David
04 18.05.2017 25.05.2017 29.05.2017 Assignment 4 David
05 26.05.2017 02.05.2017 12.06.2017 Assignment 5 David
06 01.06.2017 08.06.2017 12.06.2017 Assignment 6 David Solution
07 08.06.2017 15.06.2017 19.06.2017 Assignment 7 David
08 15.06.2017 22.06.2017 26.06.2017 Assignment 8 David Corrected Version!
09 22.06.2017 29.06.2017 03.07.2017 Assignment 9 David
10 29.06.2017 06.07.2017 10.07.2017 Assignment 10 David
11 06.07.2017 13.07.2017 17.07.2017 Assignment 11 David
12 13.07.2017 20.07.2017 24.07.2017 Assignment 12 David clique tree

Course Notes and Supplemental Material

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

  • Lecture notes (updated 27 July 2017)
  • Revised lecture notes for this edition. We attempt to provide updates in a timely manner.
  • Friendship Paradox
  • Textbooks

    Further Information (in German)