On the computation of kantorovich-wasserstein distances between two-dimensional histograms by uncapacitated minimum cost flows