[Lemon-commits] Peter Kovacs: Add citations to CycleCanceling (#...
Lemon HG
hg at lemon.cs.elte.hu
Mon Dec 14 06:17:46 CET 2009
details: http://lemon.cs.elte.hu/hg/lemon/rev/277ef0218f0c
changeset: 882:277ef0218f0c
user: Peter Kovacs <kpeter [at] inf.elte.hu>
date: Fri Nov 13 00:11:11 2009 +0100
description:
Add citations to CycleCanceling (#180, #184)
diffstat:
lemon/cycle_canceling.h | 10 +++++++---
1 files changed, 7 insertions(+), 3 deletions(-)
diffs (31 lines):
diff --git a/lemon/cycle_canceling.h b/lemon/cycle_canceling.h
--- a/lemon/cycle_canceling.h
+++ b/lemon/cycle_canceling.h
@@ -45,7 +45,9 @@
/// finding a \ref min_cost_flow "minimum cost flow".
///
/// \ref CycleCanceling implements three different cycle-canceling
- /// algorithms for finding a \ref min_cost_flow "minimum cost flow".
+ /// algorithms for finding a \ref min_cost_flow "minimum cost flow"
+ /// \ref amo93networkflows, \ref klein67primal,
+ /// \ref goldberg89cyclecanceling.
/// The most efficent one (both theoretically and practically)
/// is the \ref CANCEL_AND_TIGHTEN "Cancel and Tighten" algorithm,
/// thus it is the default method.
@@ -124,12 +126,14 @@
/// number for detecting negative cycles in the residual network.
SIMPLE_CYCLE_CANCELING,
/// The "Minimum Mean Cycle-Canceling" algorithm, which is a
- /// well-known strongly polynomial method. It improves along a
+ /// well-known strongly polynomial method
+ /// \ref goldberg89cyclecanceling. It improves along a
/// \ref min_mean_cycle "minimum mean cycle" in each iteration.
/// Its running time complexity is O(n<sup>2</sup>m<sup>3</sup>log(n)).
MINIMUM_MEAN_CYCLE_CANCELING,
/// The "Cancel And Tighten" algorithm, which can be viewed as an
- /// improved version of the previous method.
+ /// improved version of the previous method
+ /// \ref goldberg89cyclecanceling.
/// It is faster both in theory and in practice, its running time
/// complexity is O(n<sup>2</sup>m<sup>2</sup>log(n)).
CANCEL_AND_TIGHTEN
More information about the Lemon-commits
mailing list