Changeset 1049:7bf489cf624e in lemonmain for doc
 Timestamp:
 03/16/13 13:14:35 (7 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/groups.dox
r1038 r1049 393 393 This group contains the algorithms for finding minimum cost flows and 394 394 circulations \ref amo93networkflows. For more information about this 395 problem and its dual solution, see \ref min_cost_flow395 problem and its dual solution, see: \ref min_cost_flow 396 396 "Minimum Cost Flow Problem". 397 397 … … 485 485 time is exponential. 486 486 Both \ref KarpMmc "Karp" and \ref HartmannOrlinMmc "HartmannOrlin" algorithms 487 run in time O(ne) and use space O(n<sup>2</sup>+e), but the latter one is 488 typically faster due to the applied early termination scheme. 487 run in time O(ne) and use space O(n<sup>2</sup>+e). 489 488 */ 490 489
Note: See TracChangeset
for help on using the changeset viewer.