1.1 --- a/lemon/cycle_canceling.h	Tue Aug 06 05:38:49 2013 +0200
     1.2 +++ b/lemon/cycle_canceling.h	Tue Aug 06 05:48:18 2013 +0200
     1.3 @@ -51,7 +51,7 @@
     1.4    /// \cite goldberg89cyclecanceling.
     1.5    /// The most efficent one is the \ref CANCEL_AND_TIGHTEN
     1.6    /// "Cancel-and-Tighten" algorithm, thus it is the default method.
     1.7 -  /// It runs in strongly polynomial time O(n<sup>2</sup>m<sup>2</sup>log(n)),
     1.8 +  /// It runs in strongly polynomial time \f$O(n^2 m^2 \log n)\f$,
     1.9    /// but in practice, it is typically orders of magnitude slower than
    1.10    /// the scaling algorithms and \ref NetworkSimplex.
    1.11    /// (For more information, see \ref min_cost_flow_algs "the module page".)
    1.12 @@ -133,13 +133,13 @@
    1.13        /// well-known strongly polynomial method
    1.14        /// \cite goldberg89cyclecanceling. It improves along a
    1.15        /// \ref min_mean_cycle "minimum mean cycle" in each iteration.
    1.16 -      /// Its running time complexity is O(n<sup>2</sup>m<sup>3</sup>log(n)).
    1.17 +      /// Its running time complexity is \f$O(n^2 m^3 \log n)\f$.
    1.18        MINIMUM_MEAN_CYCLE_CANCELING,
    1.19        /// The "Cancel-and-Tighten" algorithm, which can be viewed as an
    1.20        /// improved version of the previous method
    1.21        /// \cite goldberg89cyclecanceling.
    1.22        /// It is faster both in theory and in practice, its running time
    1.23 -      /// complexity is O(n<sup>2</sup>m<sup>2</sup>log(n)).
    1.24 +      /// complexity is \f$O(n^2 m^2 \log n)\f$.
    1.25        CANCEL_AND_TIGHTEN
    1.26      };
    1.27