Discrete Math Seminar

Given an undirected planar graph $G$ with $n$ vertices and a set $T$ of $k$ pairs $(s_i,t_i{)}_{i=1}^k$ of vertices, the goal of the planar disjoint paths problem is to find …