ShareDP: Finding k Disjoint Paths for Multiple Vertex Pairs

Zhiqiu Yuan, Youhuan Li, Lei Zou +1

Finding k disjoint paths (kDP) is a fundamental problem in graph analysis. For vertices s and t, paths from s to t are said to be disjoint if any two of them share no common vertex…