diff -r eb2f9d453070 -r 1c978b5bcc65 lemon/preflow.h
--- a/lemon/preflow.h	Sat Mar 16 14:11:32 2013 +0100
+++ b/lemon/preflow.h	Mon Mar 18 17:41:19 2013 +0100
@@ -102,8 +102,8 @@
   ///
   /// This class provides an implementation of Goldberg-Tarjan's \e preflow
   /// \e push-relabel algorithm producing a \ref max_flow
-  /// "flow of maximum value" in a digraph \ref clrs01algorithms,
-  /// \ref amo93networkflows, \ref goldberg88newapproach.
+  /// "flow of maximum value" in a digraph \cite clrs01algorithms,
+  /// \cite amo93networkflows, \cite goldberg88newapproach.
   /// The preflow algorithms are the fastest known maximum
   /// flow algorithms. The current implementation uses a mixture of the
   /// \e "highest label" and the \e "bound decrease" heuristics.