We present an efficient algorithm for computing the partition corresponding to the greatest crisp bisimulation of a given finite fuzzy labeled graph. Its complexity is of order O((mlogl+n)logn), where n, m and l are the number of vertices, the number of nonzero edges and the number of different fuzzy degrees of edges of the input graph, respectively. We also study a similar problem for the setting with counting successors, which corresponds to the case with qualified number restrictions in description logics and graded modalities in modal logics. In particular, we provide an efficient algorithm with the complexity O((mlogm+n)logn) for the considered problem in that setting.