1.1 --- a/doc/groups.dox	Thu Nov 12 23:49:05 2009 +0100
     1.2 +++ b/doc/groups.dox	Thu Nov 12 23:52:51 2009 +0100
     1.3 @@ -406,15 +406,13 @@
     1.4  LEMON contains several algorithms for this problem.
     1.5   - \ref NetworkSimplex Primal Network Simplex algorithm with various
     1.6     pivot strategies \ref dantzig63linearprog, \ref kellyoneill91netsimplex.
     1.7 - - \ref CostScaling Push-Relabel and Augment-Relabel algorithms based on
     1.8 -   cost scaling \ref goldberg90approximation, \ref goldberg97efficient,
     1.9 + - \ref CostScaling Cost Scaling algorithm based on push/augment and
    1.10 +   relabel operations \ref goldberg90approximation, \ref goldberg97efficient,
    1.11     \ref bunnagel98efficient.
    1.12 - - \ref CapacityScaling Successive Shortest %Path algorithm with optional
    1.13 -   capacity scaling \ref edmondskarp72theoretical.
    1.14 - - \ref CancelAndTighten The Cancel and Tighten algorithm
    1.15 -   \ref goldberg89cyclecanceling.
    1.16 - - \ref CycleCanceling Cycle-Canceling algorithms
    1.17 -   \ref klein67primal, \ref goldberg89cyclecanceling.
    1.18 + - \ref CapacityScaling Capacity Scaling algorithm based on the successive
    1.19 +   shortest path method \ref edmondskarp72theoretical.
    1.20 + - \ref CycleCanceling Cycle-Canceling algorithms, two of which are
    1.21 +   strongly polynomial \ref klein67primal, \ref goldberg89cyclecanceling.
    1.22  
    1.23  In general NetworkSimplex is the most efficient implementation,
    1.24  but in special cases other algorithms could be faster.