Cohen, Edith; Megiddo, Nimrod Algorithms and complexity analysis for some flow problems. (English) Zbl 0795.68100 Algorithmica 11, No. 3, 320-340 (1994). MSC: 68Q25 68R10 90C05 90C35 PDF BibTeX XML Cite \textit{E. Cohen} and \textit{N. Megiddo}, Algorithmica 11, No. 3, 320--340 (1994; Zbl 0795.68100) Full Text: DOI
Feder, Tomás Network flow and 2-satisfiability. (English) Zbl 0795.68097 Algorithmica 11, No. 3, 291-319 (1994). MSC: 68Q25 68R10 90B10 05C70 PDF BibTeX XML Cite \textit{T. Feder}, Algorithmica 11, No. 3, 291--319 (1994; Zbl 0795.68097) Full Text: DOI
Gusfield, Dan; Tardos, Éva A faster parametric minimum-cut algorithm. (English) Zbl 0795.68099 Algorithmica 11, No. 3, 278-290 (1994). MSC: 68Q25 68R10 90B10 90C35 05C20 PDF BibTeX XML Cite \textit{D. Gusfield} and \textit{É. Tardos}, Algorithmica 11, No. 3, 278--290 (1994; Zbl 0795.68099) Full Text: DOI
Pinto, Yaron; Shamir, Ron Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs. (English) Zbl 0794.68071 Algorithmica 11, No. 3, 256-277 (1994). MSC: 68Q25 68R10 90B18 PDF BibTeX XML Cite \textit{Y. Pinto} and \textit{R. Shamir}, Algorithmica 11, No. 3, 256--277 (1994; Zbl 0794.68071) Full Text: DOI
Iwano, Kazuo; Misono, Shinji; Tezuka, Shu; Fujishige, Satoru A new saling algorithm for the maximum mean cut problem. (English) Zbl 0793.68116 Algorithmica 11, No. 3, 243-255 (1994). MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{K. Iwano} et al., Algorithmica 11, No. 3, 243--255 (1994; Zbl 0793.68116) Full Text: DOI
Radzik, Tomasz; Goldberg, Andrew V. Tight bounds on the number of minimum-mean cycle cancellations and related results. (English) Zbl 0795.68098 Algorithmica 11, No. 3, 226-242 (1994). MSC: 68Q25 68R10 90B10 PDF BibTeX XML Cite \textit{T. Radzik} and \textit{A. V. Goldberg}, Algorithmica 11, No. 3, 226--242 (1994; Zbl 0795.68098) Full Text: DOI
Khuller, Samir; Naor, Joseph Flow in planar graphs with vertex capacities. (English) Zbl 0794.68114 Algorithmica 11, No. 3, 200-225 (1994). MSC: 68R10 90B10 PDF BibTeX XML Cite \textit{S. Khuller} and \textit{J. Naor}, Algorithmica 11, No. 3, 200--225 (1994; Zbl 0794.68114) Full Text: DOI