Universität Wien
Warning! The directory is not yet complete and will be amended until the beginning of the term.

390036 UK VGSCO Spectral Graph Theory and Algorithms (2017S)

Continuous assessment of course work

Registration/Deregistration

Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).

Details

max. 50 participants
Language: English

Lecturers

Classes (iCal) - next class is marked with N

  • Monday 19.06. 10:00 - 12:00 Seminarraum 4 Oskar-Morgenstern-Platz 1 1.Stock
  • Tuesday 20.06. 13:30 - 15:30 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
  • Wednesday 21.06. 10:00 - 12:00 Seminarraum 4 Oskar-Morgenstern-Platz 1 1.Stock
  • Thursday 22.06. 10:00 - 12:00 Studierzone
  • Friday 23.06. 10:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß
  • Monday 26.06. 10:00 - 12:00 Seminarraum 4 Oskar-Morgenstern-Platz 1 1.Stock
  • Tuesday 27.06. 13:30 - 15:30 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
  • Wednesday 28.06. 10:00 - 12:00 Seminarraum 4 Oskar-Morgenstern-Platz 1 1.Stock
  • Thursday 29.06. 10:00 - 12:00 Studierzone
  • Friday 30.06. 10:00 - 12:00 Seminarraum 1 Oskar-Morgenstern-Platz 1 Erdgeschoß

Information

Aims, contents and method of the course

We will give an overview of the surprising connection between the eigenvalues and eigenvectors of graphs expressed as matrices, and classical questions in graph theory, such as bipartiteness, planarity, cliques, colorings, cuts, flows, paths, and walks. Both older structural results and recent algorithmic results will be presented. Topics to be covered include the matrix-tree theorem, Cheeger's inequality, Trevisan's max cut algorithm, bounds on random walks, Laplacian solvers, electrical flow and its applications to max flow.

Assessment and permitted materials

Minimum requirements and assessment criteria

Examination topics

Reading list


Association in the course directory

Last modified: Mo 07.09.2020 15:46