1.1 --- a/doc/groups.dox	Mon Jan 30 23:24:14 2012 +0100
     1.2 +++ b/doc/groups.dox	Mon Jan 30 23:24:40 2012 +0100
     1.3 @@ -407,7 +407,12 @@
     1.4     strongly polynomial \ref klein67primal, \ref goldberg89cyclecanceling.
     1.5  
     1.6  In general, \ref NetworkSimplex and \ref CostScaling are the most efficient
     1.7 -implementations, but the other algorithms could be faster in special cases.
     1.8 +implementations.
     1.9 +\ref NetworkSimplex is usually the fastest on relatively small graphs (up to
    1.10 +several thousands of nodes) and on dense graphs, while \ref CostScaling is
    1.11 +typically more efficient on large graphs (e.g. hundreds of thousands of
    1.12 +nodes or above), especially if they are sparse.
    1.13 +However, other algorithms could be faster in special cases.
    1.14  For example, if the total supply and/or capacities are rather small,
    1.15  \ref CapacityScaling is usually the fastest algorithm (without effective scaling).
    1.16