BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260408T090222Z
UID:Seminar-dept-1318@lxserverA.csc.liv.ac.uk.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20260324T130000
DTEND:20260324T140000
SUMMARY:School Seminar Series
DESCRIPTION:Jara Uitto: Massively Parallel Algorithms for Symmetry-Breaking Problems in Sparse Graphs\n\n The Massively Parallel Computation (MPC) model is a well-established mathematical abstraction of modern frameworks of parallel computation. An input graph is partitioned among a set of machines that communicate with each other to collectively solve a graph problem. The crux of the model is that each machine has bounded space, that is, each machine only sees a tiny fraction of the input and has limited communication bandwidth.\n\n\n\nCentral problems in this model include symmetry-breaking problems such as finding large independent sets, matchings, and colorings. In this talk, I will survey classic results and recent developments on those problems with a particular focus on sparse input graphs.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1318
LOCATION:EEE Building, Elec201
END:VEVENT
END:VCALENDAR