BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:682e4cf4b1202
DTSTART;TZID=America/Toronto:20210115T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210115T153000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-anupam-gupta-1
SUMMARY:Tutte Colloquium: Anupam Gupta
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Finding and Counting k-cuts in Graphs\n\nSp
 eaker:\n Anupam Gupta\n\nAffiliation:\n\nCarnegie Mellon University\n\nZoo
 m:\n Please email Emma Watson\n\nABSTRACT:\n\nFor an undirected graph wit
 h edge weights\, a k-cut is a set of edges\nwhose deletion breaks the grap
 h into at least k connected components.\nHow fast can we find a minimum-we
 ight k-cut? And how many minimum\nk-cuts can a graph have? The two problem
 s are closely linked. In 1996\nKarger and Stein showed how to find a minim
 um k-cut in approximately\nn^{2k-2} time\; their proof also bounded the nu
 mber of minimum k-cuts\nby n^{2k-2}\, using the probabilistic method.\n 
DTSTAMP:20250521T220020Z
END:VEVENT
END:VCALENDAR