diff -r eb2f9d453070 -r 1c978b5bcc65 lemon/capacity_scaling.h
--- a/lemon/capacity_scaling.h	Sat Mar 16 14:11:32 2013 +0100
+++ b/lemon/capacity_scaling.h	Mon Mar 18 17:41:19 2013 +0100
@@ -66,8 +66,8 @@
   ///
   /// \ref CapacityScaling implements the capacity scaling version
   /// of the successive shortest path algorithm for finding a
-  /// \ref min_cost_flow "minimum cost flow" \ref amo93networkflows,
-  /// \ref edmondskarp72theoretical. It is an efficient dual
+  /// \ref min_cost_flow "minimum cost flow" \cite amo93networkflows,
+  /// \cite edmondskarp72theoretical. It is an efficient dual
   /// solution method, which runs in polynomial time
   /// \f$O(e\log U (n+e)\log n)\f$, where <i>U</i> denotes the maximum
   /// of node supply and arc capacity values.