1.1 --- a/lemon/capacity_scaling.h	Sat Mar 16 14:11:32 2013 +0100
     1.2 +++ b/lemon/capacity_scaling.h	Mon Mar 18 17:41:19 2013 +0100
     1.3 @@ -66,8 +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" \ref amo93networkflows,
     1.8 -  /// \ref edmondskarp72theoretical. It is an efficient dual
     1.9 +  /// \ref min_cost_flow "minimum cost flow" \cite amo93networkflows,
    1.10 +  /// \cite edmondskarp72theoretical. It is an efficient dual
    1.11    /// solution method, which runs in polynomial time
    1.12    /// \f$O(e\log U (n+e)\log n)\f$, where <i>U</i> denotes the maximum
    1.13    /// of node supply and arc capacity values.