66 citations · 332 across the 27 of their papers we have counts for
1 paper · 2 filters
Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
The classical Menger's theorem states that in any undirected (or directed) graph G, given a pair of vertices s and t, the maximum number of vertex (edge) disjoint paths is eq…