I think there should be some graph algorithm for this, to find a bottleneck in a graph