User contributions
(newest | oldest) View (newer 20 | older 20) (20 | 50 | 100 | 250 | 500)
- 03:26, 9 September 2013 (diff | hist) . . (+37) . . N Ford–Fulkerson algorithm (Redirected page to Ford–Fulkerson method) (current)
- 03:22, 9 September 2013 (diff | hist) . . (-3,817) . . Maximum flow (→Minimum s-t cut problem) (current)
- 03:18, 9 September 2013 (diff | hist) . . (+5,260) . . N Max-flow min-cut theorem (Created page with "The max-flow min-cut theorem is an important result in graph theory. It states that a weight of a minimum s-t cut in a graph equals the value of a maximum flow in a c...") (current)
- 03:01, 9 September 2013 (diff | hist) . . (+1,308) . . Augmenting path (current)
- 02:24, 9 September 2013 (diff | hist) . . (+4) . . Maximum flow (→Minimum s-t cut problem: - typo, used wrong symbol)
- 02:04, 9 September 2013 (diff | hist) . . (+3,596) . . N Augmenting path (Created page with "An augmenting path in a flow network is a path from the source to the sink in the residual network for some flow. It is so named because it is possible to ''augment'' (increa...")
- 00:27, 9 September 2013 (diff | hist) . . (+4) . . m Maximum flow (→Minimum s-t cut problem)
- 00:17, 9 September 2013 (diff | hist) . . (+12,635) . . Maximum flow
- 20:57, 7 September 2013 (diff | hist) . . (+5,922) . . Maximum flow (in progress)
- 02:06, 7 September 2013 (diff | hist) . . (+2,688) . . N Maximum flow (in progress)
- 05:23, 4 August 2013 (diff | hist) . . (+11,428) . . Dynamic programming
- 01:07, 8 June 2013 (diff | hist) . . (+140) . . Judge:Help (→Summary of supported languages)
- 00:57, 8 June 2013 (diff | hist) . . (-183) . . Judge:Help (→Judge system specifications)
- 00:54, 8 June 2013 (diff | hist) . . (+417) . . Judge:Help (→Summary of supported languages: +C++11)
- 01:26, 22 May 2013 (diff | hist) . . (-20) . . Judge:Free software
- 21:40, 18 May 2013 (diff | hist) . . (+65) . . User:Brian
- 07:47, 18 May 2013 (diff | hist) . . (+10,774) . . N User:Brian/Durak (Created page with "''This version of the rules adapted from Daniel Spivak'' '''Durak''' (Russian: '''дурак''', ''fool'') is a Russian card game played according to the following rules: # Dura...") (current)
- 04:51, 18 May 2013 (diff | hist) . . (+753) . . Canadian Computing Competition
- 04:42, 18 May 2013 (diff | hist) . . (+37) . . N File:CCCStage2Cutoff.png (CCC stage 2 cutoff versus time (year)) (current)
- 18:24, 15 May 2013 (diff | hist) . . (+9,155) . . N Canadian Computing Competition (restored from google cache)
(newest | oldest) View (newer 20 | older 20) (20 | 50 | 100 | 250 | 500)