Lectures Efficient Algorithms and
Data Structures I Advanced Network and
Graph Algorithms Gems of Computer Science I Proseminar Algorithms Exhibition Seminar Algorithms for Memory Hierarchies Courses for PhD Students Oberseminar

Next Semester SS 2010 Previous Semesters SS 2009 WS 2008/09 SS 2008 WS 2007/08 SS 2007 WS 2006/07 SS 2006 WS 2005/06 SS 2005 WS 2004/05 SS 2004 WS 2003/04 SS 2003 WS 2002/03 SS 2002 WS 2001/02 SS 2001 WS 2000/01 SS 2000 WS 1999/2000 SS 1999 WS 1998/99

Advanced Network and Graph Algorithms (WS 09/10)

---

• Lecturer:
  Dr. Hanjo Täubig

• Module: IN2158

• Area:
  4+2 lectures per week in area III (Theoretical Computer Science)

• Time and Place:
  Wednesday 10:15 - 11:45, lecture hall MI HS 2
  Friday 14:15 - 15:45, lecture hall MI HS 2

• Exercises:
  2 hours per week exercises accompanying the lectures
  Friday 12:15 - 13:45, room 03.09.034 (computer lab)
  Teaching Assistant: Tobias Lieber
  

• Audience:
  graduate students of computer science
  students with computer science as minor

• ECTS: 8 points

• Prerequisites:
  1st and 2nd year courses
  Course Efficient Algorithms and Datastructures I/II advantagious, but not necessary.

• Contents:
  
  • Centrality indices / Facility Location Problems
  • Density in (sub-)graphs
  • Advanced algorithms for connectivity problems
  • Clustering
  • Network statistics
  • Network comparison
  • Algebraic methods
  • Spectral analysis
  • Robustness

• Related and Advanced Lectures:
  Efficient Algorithms and Datastructures I

• Slides: see German page

• References:
  The lectures are based on the book
  U. Brandes, Th. Erlebach (Eds.): Network Analysis - Methodological Foundations

  (Use automatic proxy configuration from http://pac.lrz-muenchen.de/.)

• Office Hours:
  look here