BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20190331T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20181028T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260404T110020Z
UID:1542034800@ist.ac.at
DTSTART:20181112T160000
DTEND:20181112T170000
DESCRIPTION:Speaker: Monika Henzinger\nAbstract: Graphs are used in many ap
 plication domains to model entities and their relationships\, such as soci
 al networks\, the world-wide web\, road maps\, and communication networks.
  In a social network\, for example\, the entities are the users and their 
 relationships are induced by their friendships in the social network. As a
  recent study showed\, graphs modeling over a billion pair-wise relationsh
 ips are ubiquitous. Additionally\, many such graphs are not static\, but a
 re subject to a variety of changes. This leads to question how quickly inf
 ormation about a graph\, for example which entities form clusters\, can be
  updated when a change occurs. We will survey the state-of-the art of this
  research area on dynamic graph algorithms.
LOCATION:Raiffeisen Lecture Hall\, ISTA
ORGANIZER:arinya.eller@ist.ac.at
SUMMARY:Monika Henzinger: Dynamic graph algorithms: What they are and why t
 hey are needed?
URL:https://talks-calendar.ista.ac.at/events/1346
END:VEVENT
END:VCALENDAR