1.1 --- a/lemon/capacity_scaling.h	Thu Nov 12 23:49:05 2009 +0100
     1.2 +++ b/lemon/capacity_scaling.h	Thu Nov 12 23:52:51 2009 +0100
     1.3 @@ -66,7 +66,8 @@
     1.4    ///
     1.5    /// \ref CapacityScaling implements the capacity scaling version
     1.6    /// of the successive shortest path algorithm for finding a
     1.7 -  /// \ref min_cost_flow "minimum cost flow". It is an efficient dual
     1.8 +  /// \ref min_cost_flow "minimum cost flow" \ref amo93networkflows,
     1.9 +  /// \ref edmondskarp72theoretical. It is an efficient dual
    1.10    /// solution method.
    1.11    ///
    1.12    /// Most of the parameters of the problem (except for the digraph)