1.1 --- a/lemon/karp_mmc.h	Sun Jan 29 22:33:14 2012 +0100
     1.2 +++ b/lemon/karp_mmc.h	Mon Jan 30 23:24:14 2012 +0100
     1.3 @@ -98,7 +98,7 @@
     1.4    ///
     1.5    /// This class implements Karp's algorithm for finding a directed
     1.6    /// cycle of minimum mean cost in a digraph
     1.7 -  /// \ref amo93networkflows, \ref dasdan98minmeancycle.
     1.8 +  /// \ref karp78characterization, \ref dasdan98minmeancycle.
     1.9    /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
    1.10    ///
    1.11    /// \tparam GR The type of the digraph the algorithm runs on.