BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//OpenRoster//openroster//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:OpenRoster: Seminar • Algorithms and Complexity • Minimum 
 Cut in Single-Pass Streams
X-PUBLISHED-TTL:PT6H
REFRESH-INTERVAL;VALUE=DURATION:PT6H
BEGIN:VEVENT
UID:2026-11-cheriton-school-of-c-seminar-algorithms-and-complexity-minimum-
 cut-in-e81f@openroster
DTSTAMP:20261103T005830Z
DTSTART:20261104T170000Z
DTEND:20261104T180000Z
SUMMARY:Seminar • Algorithms and Complexity • Minimum Cut in Single-Pas
 s Streams
DESCRIPTION:Hybrid tech talk by Cheriton School of Computer Science events 
 (iCal) in Waterloo.\n\n\nDetails and source: https://openroster-seven.verc
 el.app/o/2026-11-cheriton-school-of-c-seminar-algorithms-and-complexity-mi
 nimum-cut-in-e81f/
URL:https://openroster-seven.vercel.app/o/2026-11-cheriton-school-of-c-semi
 nar-algorithms-and-complexity-minimum-cut-in-e81f/
LOCATION:Waterloo\, ON
CATEGORIES:Tech talk
END:VEVENT
END:VCALENDAR