1.1 --- a/doc/groups.dox	Tue Aug 06 12:28:37 2013 +0200
     1.2 +++ b/doc/groups.dox	Tue Aug 06 17:58:59 2013 +0200
     1.3 @@ -497,7 +497,7 @@
     1.4  most efficient one, though the best known theoretical bound on its running
     1.5  time is exponential.
     1.6  Both \ref KarpMmc "Karp" and \ref HartmannOrlinMmc "Hartmann-Orlin" algorithms
     1.7 -run in time O(ne) and use space O(n<sup>2</sup>+e).
     1.8 +run in time O(nm) and use space O(n<sup>2</sup>+m).
     1.9  */
    1.10  
    1.11  /**