Index: lemon/cycle_canceling.h
===================================================================
--- lemon/cycle_canceling.h (revision 881)
+++ lemon/cycle_canceling.h (revision 882)
@@ -46,5 +46,7 @@
///
/// \ref CycleCanceling implements three different cycle-canceling
- /// algorithms for finding a \ref min_cost_flow "minimum cost flow".
+ /// algorithms for finding a \ref min_cost_flow "minimum cost flow"
+ /// \ref amo93networkflows, \ref klein67primal,
+ /// \ref goldberg89cyclecanceling.
/// The most efficent one (both theoretically and practically)
/// is the \ref CANCEL_AND_TIGHTEN "Cancel and Tighten" algorithm,
@@ -125,10 +127,12 @@
SIMPLE_CYCLE_CANCELING,
/// The "Minimum Mean Cycle-Canceling" algorithm, which is a
- /// well-known strongly polynomial method. It improves along a
+ /// well-known strongly polynomial method
+ /// \ref goldberg89cyclecanceling. It improves along a
/// \ref min_mean_cycle "minimum mean cycle" in each iteration.
/// Its running time complexity is O(n^{2}m^{3}log(n)).
MINIMUM_MEAN_CYCLE_CANCELING,
/// The "Cancel And Tighten" algorithm, which can be viewed as an
- /// improved version of the previous method.
+ /// improved version of the previous method
+ /// \ref goldberg89cyclecanceling.
/// It is faster both in theory and in practice, its running time
/// complexity is O(n^{2}m^{2}log(n)).