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:20200519T163000
DTEND;TZID=Asia/Seoul:20200519T173000
DTSTAMP:20260420T081820
CREATED:20200422T003736Z
LAST-MODIFIED:20240705T201022Z
UID:2383-1589905800-1589909400@dimag.ibs.re.kr
SUMMARY:O-joung Kwon (권오정)\,  Mim-width: a width parameter beyond rank-width
DESCRIPTION:Vatshelle (2012) introduced a width parameter called mim-width. It is based on the following cut function : for a vertex partition (A\,B) of a graph\, the complexity of this partition is computed by the size of a maximum induced matching of the bipartite subgraph induced by edges between A and B. This parameter naturally extends the expressibility power of the graph parameters clique-width and rank-width\, which have been well-developed in recent years. In a series of papers\, we explored the computational complexity of several problems\, parameterized by mim-width. We summarize known structural properties and algorithmic applications of mim-width\, and give some open problems at the end. This is joint work with Lars Jaffke\, Torstein Strømme\, and Jan Arne Telle.
URL:https://dimag.ibs.re.kr/event/2020-05-19/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR