1.1 --- a/doc/groups.dox	Thu Nov 05 08:39:49 2009 +0100
     1.2 +++ b/doc/groups.dox	Thu Oct 15 12:55:41 2009 +0200
     1.3 @@ -457,7 +457,8 @@
     1.4  @ingroup algs
     1.5  \brief Algorithms for finding minimum mean cycles.
     1.6  
     1.7 -This group contains the algorithms for finding minimum mean cycles.
     1.8 +This group contains the algorithms for finding minimum mean cycles
     1.9 +\ref clrs01algorithms, \ref amo93networkflows.
    1.10  
    1.11  The \e minimum \e mean \e cycle \e problem is to find a directed cycle
    1.12  of minimum mean length (cost) in a digraph.
    1.13 @@ -473,10 +474,12 @@
    1.14  function.
    1.15  
    1.16  LEMON contains three algorithms for solving the minimum mean cycle problem:
    1.17 -- \ref Karp "Karp"'s original algorithm.
    1.18 +- \ref Karp "Karp"'s original algorithm \ref amo93networkflows,
    1.19 +  \ref dasdan98minmeancycle.
    1.20  - \ref HartmannOrlin "Hartmann-Orlin"'s algorithm, which is an improved
    1.21 -  version of Karp's algorithm.
    1.22 -- \ref Howard "Howard"'s policy iteration algorithm.
    1.23 +  version of Karp's algorithm \ref dasdan98minmeancycle.
    1.24 +- \ref Howard "Howard"'s policy iteration algorithm
    1.25 +  \ref dasdan98minmeancycle.
    1.26  
    1.27  In practice, the Howard algorithm proved to be by far the most efficient
    1.28  one, though the best known theoretical bound on its running time is