1.1 --- a/lemon/cycle_canceling.h Sat Mar 16 14:11:32 2013 +0100
1.2 +++ b/lemon/cycle_canceling.h Mon Mar 18 17:41:19 2013 +0100
1.3 @@ -47,8 +47,8 @@
1.4 ///
1.5 /// \ref CycleCanceling implements three different cycle-canceling
1.6 /// algorithms for finding a \ref min_cost_flow "minimum cost flow"
1.7 - /// \ref amo93networkflows, \ref klein67primal,
1.8 - /// \ref goldberg89cyclecanceling.
1.9 + /// \cite amo93networkflows, \cite klein67primal,
1.10 + /// \cite goldberg89cyclecanceling.
1.11 /// The most efficent one is the \ref CANCEL_AND_TIGHTEN
1.12 /// "Cancel-and-Tighten" algorithm, thus it is the default method.
1.13 /// It runs in strongly polynomial time O(n<sup>2</sup>e<sup>2</sup>log(n)),
1.14 @@ -131,13 +131,13 @@
1.15 SIMPLE_CYCLE_CANCELING,
1.16 /// The "Minimum Mean Cycle-Canceling" algorithm, which is a
1.17 /// well-known strongly polynomial method
1.18 - /// \ref goldberg89cyclecanceling. It improves along a
1.19 + /// \cite goldberg89cyclecanceling. It improves along a
1.20 /// \ref min_mean_cycle "minimum mean cycle" in each iteration.
1.21 /// Its running time complexity is O(n<sup>2</sup>e<sup>3</sup>log(n)).
1.22 MINIMUM_MEAN_CYCLE_CANCELING,
1.23 /// The "Cancel-and-Tighten" algorithm, which can be viewed as an
1.24 /// improved version of the previous method
1.25 - /// \ref goldberg89cyclecanceling.
1.26 + /// \cite goldberg89cyclecanceling.
1.27 /// It is faster both in theory and in practice, its running time
1.28 /// complexity is O(n<sup>2</sup>e<sup>2</sup>log(n)).
1.29 CANCEL_AND_TIGHTEN