1 citations · 1 across the 4 of their papers we have counts for
1 paper · 1 filter
Michał Pilipczuk, Giannos Stamoulis, Michał Włodarczyk
In the Disjoint Shortest Paths problem one is given a graph G and a set T={(s1,t1),…,(sk,tk)} of k vertex pairs. The question is whether there exist verte…