diff -r 432c54cec63c -r 8452ca46e29a doc/groups.dox
--- a/doc/groups.dox	Thu Nov 05 08:39:49 2009 +0100
+++ b/doc/groups.dox	Thu Oct 15 12:55:41 2009 +0200
@@ -457,7 +457,8 @@
 @ingroup algs
 \brief Algorithms for finding minimum mean cycles.
 
-This group contains the algorithms for finding minimum mean cycles.
+This group contains the algorithms for finding minimum mean cycles
+\ref clrs01algorithms, \ref amo93networkflows.
 
 The \e minimum \e mean \e cycle \e problem is to find a directed cycle
 of minimum mean length (cost) in a digraph.
@@ -473,10 +474,12 @@
 function.
 
 LEMON contains three algorithms for solving the minimum mean cycle problem:
-- \ref Karp "Karp"'s original algorithm.
+- \ref Karp "Karp"'s original algorithm \ref amo93networkflows,
+  \ref dasdan98minmeancycle.
 - \ref HartmannOrlin "Hartmann-Orlin"'s algorithm, which is an improved
-  version of Karp's algorithm.
-- \ref Howard "Howard"'s policy iteration algorithm.
+  version of Karp's algorithm \ref dasdan98minmeancycle.
+- \ref Howard "Howard"'s policy iteration algorithm
+  \ref dasdan98minmeancycle.
 
 In practice, the Howard algorithm proved to be by far the most efficient
 one, though the best known theoretical bound on its running time is