Index: doc/groups.dox
===================================================================
--- doc/groups.dox (revision 770)
+++ doc/groups.dox (revision 771)
@@ -458,5 +458,6 @@
\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
@@ -474,8 +475,10 @@
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
Index: lemon/hartmann_orlin.h
===================================================================
--- lemon/hartmann_orlin.h (revision 769)
+++ lemon/hartmann_orlin.h (revision 771)
@@ -98,5 +98,6 @@
///
/// This class implements the Hartmann-Orlin algorithm for finding
- /// a directed cycle of minimum mean length (cost) in a digraph.
+ /// a directed cycle of minimum mean length (cost) in a digraph
+ /// \ref amo93networkflows, \ref dasdan98minmeancycle.
/// It is an improved version of \ref Karp "Karp"'s original algorithm,
/// it applies an efficient early termination scheme.
Index: lemon/howard.h
===================================================================
--- lemon/howard.h (revision 769)
+++ lemon/howard.h (revision 771)
@@ -98,5 +98,6 @@
///
/// This class implements Howard's policy iteration algorithm for finding
- /// a directed cycle of minimum mean length (cost) in a digraph.
+ /// a directed cycle of minimum mean length (cost) in a digraph
+ /// \ref amo93networkflows, \ref dasdan98minmeancycle.
/// This class provides the most efficient algorithm for the
/// minimum mean cycle problem, though the best known theoretical
Index: lemon/karp.h
===================================================================
--- lemon/karp.h (revision 769)
+++ lemon/karp.h (revision 771)
@@ -98,5 +98,6 @@
///
/// This class implements Karp's algorithm for finding a directed
- /// cycle of minimum mean length (cost) in a digraph.
+ /// cycle of minimum mean length (cost) in a digraph
+ /// \ref amo93networkflows, \ref dasdan98minmeancycle.
/// It runs in time O(ne) and uses space O(n^{2}+e).
///