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