diff -r 48e17328c155 -r f63ba40a60f4 lemon/howard_mmc.h
--- a/lemon/howard_mmc.h	Sun Jan 29 22:33:14 2012 +0100
+++ b/lemon/howard_mmc.h	Mon Jan 30 23:24:14 2012 +0100
@@ -98,7 +98,7 @@
   ///
   /// This class implements Howard's policy iteration algorithm for finding
   /// a directed cycle of minimum mean cost in a digraph
-  /// \ref amo93networkflows, \ref dasdan98minmeancycle.
+  /// \ref dasdan98minmeancycle, \ref dasdan04experimental.
   /// This class provides the most efficient algorithm for the
   /// minimum mean cycle problem, though the best known theoretical
   /// bound on its running time is exponential.