summary |
shortlog |
changelog |
graph |
tags |
bookmarks |
branches |
files |
changeset |
file |
latest |
revisions |
annotate |
diff |
comparison |
raw |
help

doc/groups.dox

changeset 1217 | 7bf489cf624e |

parent 1206 | a2d142bb5d3c |

child 1218 | d9d1cb759951 |

1.1 --- a/doc/groups.dox Fri Mar 15 17:19:17 2013 +0100 1.2 +++ b/doc/groups.dox Sat Mar 16 13:14:35 2013 +0100 1.3 @@ -392,7 +392,7 @@ 1.4 1.5 This group contains the algorithms for finding minimum cost flows and 1.6 circulations \ref amo93networkflows. For more information about this 1.7 -problem and its dual solution, see \ref min_cost_flow 1.8 +problem and its dual solution, see: \ref min_cost_flow 1.9 "Minimum Cost Flow Problem". 1.10 1.11 LEMON contains several algorithms for this problem. 1.12 @@ -484,8 +484,7 @@ 1.13 most efficient one, though the best known theoretical bound on its running 1.14 time is exponential. 1.15 Both \ref KarpMmc "Karp" and \ref HartmannOrlinMmc "Hartmann-Orlin" algorithms 1.16 -run in time O(ne) and use space O(n<sup>2</sup>+e), but the latter one is 1.17 -typically faster due to the applied early termination scheme. 1.18 +run in time O(ne) and use space O(n<sup>2</sup>+e). 1.19 */ 1.20 1.21 /**