Tomáš Masařík, Separator Theorem for Minor-free Graphs in Linear Time
The planar separator theorem by Lipton and Tarjan states that any planar graph with $n$ vertices has a balanced separator of size $O(\sqrt{n})$ that can be found in linear time. …
10 events found.
Seminars and Colloquiums
Events
-
-
Room B332 IBS (기초과학연구원)
-
Daniel Dadush, A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column
Room B332 IBS (기초과학연구원)We give a strongly polynomial algorithm for minimum cost generalized flow, and hence for optimizing any linear program with at most two non-zero entries per row, or at most two …
-
-
Xiaofan Yuan (袁晓璠), Rainbow structures in edge colored graphs
Room B332 IBS (기초과학연구원)Let $G = (V, E)$ be a graph on $n$ vertices, and let $c : E \to P$, where $P$ is a set of colors. Let $\delta^c(G) = \min_{v \in …
-
Seonghun Park (박성훈), TBA
Room B332 IBS (기초과학연구원) -
Marek Sokołowski, TBA
Room B332 IBS (기초과학연구원) -
-
Chính T. Hoàng, TBA
Room B332 IBS (기초과학연구원) -
Dario Cavallaro, TBA
Room B332 IBS (기초과학연구원) -
Hidde Koerts, TBA
Room B332 IBS (기초과학연구원) -
Tung H. Nguyen, TBA
Room B332 IBS (기초과학연구원) -
-
Xavier Goaoc, TBA
Room B332 IBS (기초과학연구원)