BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20260329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20261025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20260217T104500
DTEND;TZID=Europe/Paris:20260217T114500
DTSTAMP:20260615T204627
CREATED:20260130T101535Z
LAST-MODIFIED:20260526T114613Z
UID:12042-1771325100-1771328700@www.greyc.fr
SUMMARY:Séminaire Algorithmique : « Optimising Matching Cuts »\, Félicia Lucke (LIP\, ENS Lyon)
DESCRIPTION:The problem Matching Cut asks for an edge set of a graph which is both an edge cut and a matching. An edge cut is a set of edges whose deletion disconnects the graph and a matching is a set of edges in which no two edges share an endpoint. \nWe consider the two recent optimisation variants Maximum and Minimum Matching Cut\, where we aim to maximise\, respectively minimise\, the number of edges in the matching cut. Both variants are NP-hard but differ in complexity for certain graph classes. In this talk we investigate why maximising is harder than minimising. We further compare the optimisation variants of Matching Cut to the classical Matching Cut and its oldest variant Perfect Matching Cut.
URL:https://www.greyc.fr/event/seminaire-algorithmique-felicia-lucke-lip-ens-lyon/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR