All Day

Stephan Kreutzer, Disjoint Paths in Graphs and Digraphs

Room B332 IBS (기초과학연구원)

One of the important algorithmic consequences of Robertson and Seymour's Graph Minor Project is their proof that the k-Vertex-Disjoint Paths problem is fixed-parameter tractable on the class of all undirected