BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20190101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200826T103000
DTEND;TZID=Asia/Seoul:20200826T113000
DTSTAMP:20260423T080424
CREATED:20200629T004929Z
LAST-MODIFIED:20240705T200027Z
UID:2576-1598437800-1598441400@dimag.ibs.re.kr
SUMMARY:Nick Brettell\, On the graph width parameter mim-width
DESCRIPTION:Maximum induced matching width\, also known as mim-width\, is a width parameter for graphs introduced by Vatshelle in 2012.  This parameter can be defined over branch decompositions of a graph G\, where the width of a vertex partition (X\,Y) in G is the size of a maximum induced matching in the bipartite graph induced by edges of G with one endpoint in X and one endpoint in Y.  In this talk\, I will present a quick overview of mim-width and some key results that highlight why this parameter is of interest from both a theoretical and algorithmic point of view.  I will discuss some recent work regarding the boundedness or unboundedness of mim-width for hereditary classes defined by forbidding one or two induced subgraphs\, and for generalisations of convex graphs.  I will also touch on some interesting applications of this work\, in particular for colouring and list-colouring.  This is joint work with Jake Horsfield\, Andrea Munaro\, Giacomo Paesani\, and Daniel Paulusma.
URL:https://dimag.ibs.re.kr/event/2020-08-26/
LOCATION:Zoom ID: 869 4632 6610 (ibsdimag)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
END:VCALENDAR