1.1 --- a/lemon/grosso_locatelli_pullan_mc.h	Sat Mar 16 14:11:32 2013 +0100
     1.2 +++ b/lemon/grosso_locatelli_pullan_mc.h	Mon Mar 18 17:41:19 2013 +0100
     1.3 @@ -40,7 +40,7 @@
     1.4    ///
     1.5    /// \ref GrossoLocatelliPullanMc implements the iterated local search
     1.6    /// algorithm of Grosso, Locatelli, and Pullan for solving the \e maximum
     1.7 -  /// \e clique \e problem \ref grosso08maxclique.
     1.8 +  /// \e clique \e problem \cite grosso08maxclique.
     1.9    /// It is to find the largest complete subgraph (\e clique) in an
    1.10    /// undirected graph, i.e., the largest set of nodes where each
    1.11    /// pair of nodes is connected.