summary |
shortlog |
changelog |
graph |
tags |
bookmarks |
branches |
files |
changeset |
raw | bz2 | zip | gz |
help

author | Peter Kovacs <kpeter@inf.elte.hu> |

Fri, 13 Nov 2009 00:11:11 +0100 | |

changeset 882 | 277ef0218f0c |

parent 881 | aef153f430e1 |

child 883 | b87f0504cdbe |

Add citations to CycleCanceling (#180, #184)

1.1 --- a/lemon/cycle_canceling.h Fri Nov 13 00:10:33 2009 +0100 1.2 +++ b/lemon/cycle_canceling.h Fri Nov 13 00:11:11 2009 +0100 1.3 @@ -45,7 +45,9 @@ 1.4 /// finding a \ref min_cost_flow "minimum cost flow". 1.5 /// 1.6 /// \ref CycleCanceling implements three different cycle-canceling 1.7 - /// algorithms for finding a \ref min_cost_flow "minimum cost flow". 1.8 + /// algorithms for finding a \ref min_cost_flow "minimum cost flow" 1.9 + /// \ref amo93networkflows, \ref klein67primal, 1.10 + /// \ref goldberg89cyclecanceling. 1.11 /// The most efficent one (both theoretically and practically) 1.12 /// is the \ref CANCEL_AND_TIGHTEN "Cancel and Tighten" algorithm, 1.13 /// thus it is the default method. 1.14 @@ -124,12 +126,14 @@ 1.15 /// number for detecting negative cycles in the residual network. 1.16 SIMPLE_CYCLE_CANCELING, 1.17 /// The "Minimum Mean Cycle-Canceling" algorithm, which is a 1.18 - /// well-known strongly polynomial method. It improves along a 1.19 + /// well-known strongly polynomial method 1.20 + /// \ref goldberg89cyclecanceling. It improves along a 1.21 /// \ref min_mean_cycle "minimum mean cycle" in each iteration. 1.22 /// Its running time complexity is O(n<sup>2</sup>m<sup>3</sup>log(n)). 1.23 MINIMUM_MEAN_CYCLE_CANCELING, 1.24 /// The "Cancel And Tighten" algorithm, which can be viewed as an 1.25 - /// improved version of the previous method. 1.26 + /// improved version of the previous method 1.27 + /// \ref goldberg89cyclecanceling. 1.28 /// It is faster both in theory and in practice, its running time 1.29 /// complexity is O(n<sup>2</sup>m<sup>2</sup>log(n)). 1.30 CANCEL_AND_TIGHTEN