Author:
Kashyop Manas Jyoti,Nagayama Tsunehiko,Sadakane Kunihiko
Publisher
Springer International Publishing
Reference24 articles.
1. Alon, N., Schieber, B.: Optimal preprocessing for answering on-line product queries. Technical report, Tel-Aviv University (1987)
2. Arikati, S.R., Chaudhuri, S., Zaroliagis, C.D.: All-pairs min-cut in sparse networks. J. Algorithms 29, 82–110 (1998)
3. Benczúr, A.A.: Counterexamples for directed and node capacitated cut-trees. SIAM J. Comput. 24, 505–510 (1995)
4. Borradaile, G., Klein, P.: An O
$$ (n \log n)$$
algorithm for maximum
$$st$$
-flow in a directed planar graph. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 524–533 (2006)
5. Chaudhuri, S., Subrahmanyam, K.V., Wagner, F., Zaroliagis, C.D.: Computing mimicking networks. Algorithmica 20, 31–49 (2000)