User contributions
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 04:14, 9 September 2013 (diff | hist) . . (+38) . . N Edmonds-Karp algorithm (Redirected page to Edmonds–Karp algorithm) (current)
- 04:12, 9 September 2013 (diff | hist) . . (+2,870) . . N Ford–Fulkerson method (Created page with "The Ford–Fulkerson method is a technique for solving the maximum flow problem. The input is a flow network, <math>G_0 = (V, s, t, c)</math>. Then the algorithm proceeds...") (current)
- 03:27, 9 September 2013 (diff | hist) . . (+37) . . N Ford-Fulkerson algorithm (Redirected page to Ford–Fulkerson method) (current)
- 03:26, 9 September 2013 (diff | hist) . . (+37) . . N Ford-Fulkerson method (Redirected page to Ford–Fulkerson method) (current)
- 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)
- 03:59, 12 May 2013 (diff | hist) . . (-10,822) . . PEGWiki:Sandbox (Replaced content with "<math>testing\, 123 \, xyz</math>")
- 21:56, 1 November 2012 (diff | hist) . . (-1) . . Judge:TOS (current)
- 19:21, 3 September 2012 (diff | hist) . . (+223) . . Game theory (→Statement of the theorem) (current)
- 18:44, 3 August 2012 (diff | hist) . . (+32) . . N Right half-open interval (Redirected page to Half-open interval) (current)
- 18:31, 3 August 2012 (diff | hist) . . (+42) . . N Extended Eucliean algorithm (moved Extended Eucliean algorithm to Extended Euclidean algorithm: sp.) (current)
- 18:31, 3 August 2012 (diff | hist) . . (0) . . m Extended Euclidean algorithm (moved Extended Eucliean algorithm to Extended Euclidean algorithm: sp.) (current)
- 22:16, 1 August 2012 (diff | hist) . . (+83) . . Shortest Path Faster Algorithm
- 19:59, 1 August 2012 (diff | hist) . . (-482) . . Pointer (→Java, C#, Python, Ruby, etc.) (current)
- 19:43, 1 August 2012 (diff | hist) . . (+448) . . Pointer (→Java, C#, Python, Ruby, etc.)
- 19:03, 31 July 2012 (diff | hist) . . (+97) . . Shunting yard algorithm
- 19:01, 31 July 2012 (diff | hist) . . (+2,871) . . N Shunting yard algorithm/foo.hs (Created page with "<syntaxhighlight lang="haskell"> {- Reference implementation of shunting yard algorithm. Requires: Data.Char, Data.List. This implementation is not error-tolerant; an exception w...") (current)
- 23:30, 23 July 2012 (diff | hist) . . (+3,016) . . Convex hull trick (example contributed by Haidar Abboud)
- 21:43, 23 July 2012 (diff | hist) . . (+1,711) . . N Convex hull trick/commando.cpp (Created page with "<syntaxhighlight lang="cpp"> // The following code for APIO 2010 "Commando" was contributed by Haidar Abboud. #include <cstdio> #include <algorithm> #include <vector> using names...")
- 20:36, 14 July 2012 (diff | hist) . . (0) . . Convex hull trick/acquire.cpp
- 06:25, 7 July 2012 (diff | hist) . . (+107) . . Judge:Help (→Execution discrepancies)
- 03:05, 5 July 2012 (diff | hist) . . (+260) . . Judge:Help (→Compilation discrepancies)
- 19:31, 2 July 2012 (diff | hist) . . (+112) . . Judge:Help
- 19:24, 2 July 2012 (diff | hist) . . (+26) . . m Judge:Help (→Execution discrepancies)
- 21:47, 14 June 2012 (diff | hist) . . (+109) . . Pointer
- 19:37, 11 June 2012 (diff | hist) . . (0) . . Binary heap (→Deletion)
- 19:21, 11 June 2012 (diff | hist) . . (+635) . . Binary heap (→Analysis)
- 23:39, 10 June 2012 (diff | hist) . . (+5,247) . . Longest palindromic subsequence
- 06:15, 1 June 2012 (diff | hist) . . (+59) . . Judge:Writing (→LaTeX) (current)
- 05:50, 1 June 2012 (diff | hist) . . (+3) . . m Judge:Writing (→LaTeX)
- 02:02, 27 May 2012 (diff | hist) . . (-5,705) . . Longest palindromic subsequence (anonymous comment was right: all the math in this article was wrong)
- 02:56, 14 May 2012 (diff | hist) . . (+52) . . Half-open interval (current)
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)