BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20180325T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20171029T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260425T051703Z
UID:5a69a2aa66de5339041202@ist.ac.at
DTSTART:20180312T100000
DTEND:20180312T110000
DESCRIPTION:Speaker: Artur Czumaj\nhosted by Vladimir Kolmogorov\nAbstract:
  One of the fundamental algorithmic tasks is to efficiently determine basi
 c properties of graphs or networks.For example\, we would like to determin
 e very quickly if the input graph is planar\, or is well-clusterable\, or 
 to quickly estimate the cost of its minimum spanning tree.While in general
 \, exact versions of these problems can be computationally hard\, there ha
 ve been some recent advances in very fast approximation algorithms for som
 e of these problems.We will present some of the recent results in this are
 a and give examples of some basic graph properties that can be very effici
 ently tested in the framework of property\, often in sublinear-time\, and 
 sometimes even in constant time.We will also discuss applications and exte
 nsions of these results to some classic optimization problems.
LOCATION:Big Seminar room Ground floor / Office Bldg West (I21.EG.101)\, IS
 TA
ORGANIZER:pdelreal@ist.ac.at
SUMMARY:Artur Czumaj: Testing graph properties very quickly
URL:https://talks-calendar.ista.ac.at/events/1117
END:VEVENT
END:VCALENDAR