1.1 --- a/lemon/howard_mmc.h	Sat Mar 16 14:11:32 2013 +0100
     1.2 +++ b/lemon/howard_mmc.h	Mon Mar 18 17:41:19 2013 +0100
     1.3 @@ -98,7 +98,7 @@
     1.4    ///
     1.5    /// This class implements Howard's policy iteration algorithm for finding
     1.6    /// a directed cycle of minimum mean cost in a digraph
     1.7 -  /// \ref dasdan98minmeancycle, \ref dasdan04experimental.
     1.8 +  /// \cite dasdan98minmeancycle, \cite dasdan04experimental.
     1.9    /// This class provides the most efficient algorithm for the
    1.10    /// minimum mean cycle problem, though the best known theoretical
    1.11    /// bound on its running time is exponential.