External Links

    Journal: Algorithmica

    Volume 11, Issue 3

    197 -- 199Harold N. Gabow. Editor s Foreword: Special Issur on Network Flow Algorithms
    200 -- 225Samir Khuller, Joseph Naor. Flow in Planar Graphs with Vertex Capacities
    226 -- 242Tomasz Radzik, Andrew V. Goldberg. Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results
    243 -- 255Kazuo Iwano, Shinji Misono, Shu Tezuka, Satoru Fujishige. A New Scaling Algorithm for the Maximum Mean Cut Problem
    256 -- 276Yaron Pinto, Ron Shamir. Efficient Algorithms for Minimum-Cost Flow Problems with Piecewise-Linear Convex Costs
    278 -- 290Dan Gusfield, Éva Tardos. A Faster Parametric Minimum-Cut Algorithm
    291 -- 319Tomás Feder. Network Flow and 2-Satisfiability
    320 -- 340Edith Cohen, Nimrod Megiddo. Algorithms and Complexity Analysis for Some Flow Problems
    runs on