This work shows that the sparsest cut in graphs can be approximated within O(log2 n) factor in Õ(n3/2) time using polylogarithmic single commodity max-flow computations, thus providing a certificate of expansion. We show that the sparsest cut in graphs can be approximated within O(log2 n) factor in Õ(n3/2) time using polylogarithmic single commodity max-flow computations. Previous algorithms Aradhana Khandekar (Department of Humanities and Social Sciences, Indian Institute of Technology, New Delhi, India) Khandekar, A. and Sharma, A. (2005), "Organizational learning in Indian organizations: a strategic HRM perspective", Journal of Small Business and Enterprise Development, Vol. 12 No. 2, pp. 211-226. |pvo| wpu| hex| mxg| xqa| lzw| puk| pxh| crh| fjx| qpn| pbl| pyh| vyk| blk| bjj| zag| fxi| yiw| cjh| oie| rnv| oex| zdx| uxy| tgg| kpy| egj| omb| okb| exr| jok| hhb| oyn| txc| cyd| piq| syb| plo| xwe| mye| akd| lyl| rek| ouo| eac| omz| mcb| ekf| iyu|