Article citationsMore>>

Y. Aumann and Y. Rabani, “An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm,” SIAM Journal on Computing, Vol. 27, No. 1, 1998, pp. 291-301. doi:10.1137/S0097539794285983

has been cited by the following article:

Follow SCIRP
Twitter Facebook Linkedin Weibo
Contact us
+1 323-425-8868
customer@scirp.org
WhatsApp +86 18163351462(WhatsApp)
Click here to send a message to me 1655362766
Paper Publishing WeChat
Free SCIRP Newsletters
Copyright © 2006-2024 Scientific Research Publishing Inc. All Rights Reserved.
Top