User contributions for Weihe
Jump to navigation
Jump to search
19 October 2014
- 19:2419:24, 19 October 2014 diff hist +6 Max-flow min-cut →Proof
- 19:2419:24, 19 October 2014 diff hist −3 Max-flow min-cut →Proof
- 19:2319:23, 19 October 2014 diff hist −701 Max-flow min-cut →Max-flow min-cut theorem
- 19:1819:18, 19 October 2014 diff hist −6 Max-flow min-cut →Max-flow min-cut theorem
- 19:1819:18, 19 October 2014 diff hist +192 Max-flow min-cut →Max-flow min-cut theorem
- 19:1519:15, 19 October 2014 diff hist +164 Basic flow definitions →Cuts and saturated cuts
- 19:1319:13, 19 October 2014 diff hist +1 Basic flow definitions →Cuts and saturated cuts
- 18:1918:19, 19 October 2014 diff hist +568 Basic flow definitions No edit summary
- 18:1318:13, 19 October 2014 diff hist +1,533 Max-flow min-cut No edit summary
- 18:0418:04, 19 October 2014 diff hist +14 Ford-Fulkerson →Complexity
- 09:0209:02, 19 October 2014 diff hist +220 Ford-Fulkerson No edit summary
- 08:5708:57, 19 October 2014 diff hist +2 Ford-Fulkerson →Induction Step
- 08:5708:57, 19 October 2014 diff hist +18 Ford-Fulkerson →Induction Step
- 08:5608:56, 19 October 2014 diff hist +44 Ford-Fulkerson →Induction Step
- 08:5308:53, 19 October 2014 diff hist −32 Ford-Fulkerson →Induction Basis
- 08:5208:52, 19 October 2014 diff hist +37 Ford-Fulkerson →General Information
- 08:5208:52, 19 October 2014 diff hist +17 Ford-Fulkerson →General Information
- 08:5008:50, 19 October 2014 diff hist +65 Kosaraju →Correctness
- 08:4908:49, 19 October 2014 diff hist +87 Kosaraju →Abstract View
17 October 2014
- 16:3316:33, 17 October 2014 diff hist +1 Basic flow definitions →Blocking flow
- 16:3216:32, 17 October 2014 diff hist +18 Basic flow definitions →Residual network
- 16:3116:31, 17 October 2014 diff hist +19 Branching by Edmonds →Remarks
- 16:3116:31, 17 October 2014 diff hist +44 Branching by Edmonds →Remarks
- 16:3016:30, 17 October 2014 diff hist +106 Branching by Edmonds →Complexity
- 16:2916:29, 17 October 2014 diff hist +2 Branching by Edmonds →Induction step
- 16:2816:28, 17 October 2014 diff hist −16 Branching by Edmonds →Induction step
- 16:2716:27, 17 October 2014 diff hist +55 Branching by Edmonds →Induction step
- 16:2316:23, 17 October 2014 diff hist +10 Branching by Edmonds →Induction step
- 16:2116:21, 17 October 2014 diff hist 0 Branching by Edmonds →Induction step
- 16:2116:21, 17 October 2014 diff hist 0 Branching by Edmonds →Induction step
- 16:1816:18, 17 October 2014 diff hist −1 Branching by Edmonds →Abstract view
- 16:1716:17, 17 October 2014 diff hist −26 Branching by Edmonds →Abstract view
- 16:0916:09, 17 October 2014 diff hist +9 Maximum branching →General information
- 16:0616:06, 17 October 2014 diff hist +8 Classical eulerian cycle algorithm →Complexity
- 16:0216:02, 17 October 2014 diff hist +136 Classical eulerian cycle algorithm →Complexity
- 16:0016:00, 17 October 2014 diff hist 0 Classical eulerian cycle algorithm →Correctness
- 15:5915:59, 17 October 2014 diff hist +6 Classical eulerian cycle algorithm →Correctness
- 15:5215:52, 17 October 2014 diff hist +27 Classical eulerian cycle algorithm →Induction step
- 15:5215:52, 17 October 2014 diff hist +1 Classical eulerian cycle algorithm →General information
- 15:4815:48, 17 October 2014 diff hist −88 Eulerian cycle No edit summary
- 15:4815:48, 17 October 2014 diff hist +89 Classical eulerian cycle algorithm No edit summary
- 15:4815:48, 17 October 2014 diff hist −351 Eulerian cycle →Example
- 15:4815:48, 17 October 2014 diff hist +351 Classical eulerian cycle algorithm No edit summary
- 15:4615:46, 17 October 2014 diff hist +113 Breadth-first search →Remark
- 15:4315:43, 17 October 2014 diff hist +55 Breadth-first search →Correctness
- 15:4215:42, 17 October 2014 diff hist +1 Breadth-first search →Induction step
- 15:4215:42, 17 October 2014 diff hist 0 Breadth-first search →Induction step
- 15:4115:41, 17 October 2014 diff hist +85 Breadth-first search →Induction step
- 15:3915:39, 17 October 2014 diff hist 0 Breadth-first search →Induction basis
- 15:2615:26, 17 October 2014 diff hist +7 Breadth-first search →Induction basis
- 15:2615:26, 17 October 2014 diff hist +80 Breadth-first search →Induction basis
- 15:1315:13, 17 October 2014 diff hist −1 Breadth-first search →General information
- 15:1315:13, 17 October 2014 diff hist +106 Breadth-first search →Abstract view
- 14:5914:59, 17 October 2014 diff hist −47 Depth-first search →Correctness
- 14:5614:56, 17 October 2014 diff hist +5 Depth-first search →Induction step
- 14:5614:56, 17 October 2014 diff hist 0 Depth-first search →Induction step
- 14:5514:55, 17 October 2014 diff hist +188 Depth-first search →Induction step
- 14:4914:49, 17 October 2014 diff hist +103 Depth-first search →Induction basis
- 14:4614:46, 17 October 2014 diff hist +18 Depth-first search →Abstract view
- 14:4414:44, 17 October 2014 diff hist +2 Depth-first search →Abstract view
- 14:4414:44, 17 October 2014 diff hist +138 Depth-first search →Abstract view
- 14:4314:43, 17 October 2014 diff hist +3 Depth-first search →Abstract view
- 14:4314:43, 17 October 2014 diff hist +310 Depth-first search →Abstract view
- 14:3814:38, 17 October 2014 diff hist +9 Graph traversal →Remarks
- 14:3714:37, 17 October 2014 diff hist +7 Graph traversal →Remarks
- 14:3714:37, 17 October 2014 diff hist +138 Graph traversal →Remarks
- 14:3314:33, 17 October 2014 diff hist +2 Bounded monotonous priority queue →Known implementations current
- 14:3314:33, 17 October 2014 diff hist +1 Bounded monotonous priority queue →Method
- 14:3314:33, 17 October 2014 diff hist +1 Bounded monotonous priority queue →Method
- 14:3214:32, 17 October 2014 diff hist +1 Bounded monotonous priority queue →Method
- 14:3214:32, 17 October 2014 diff hist +1 Bounded monotonous priority queue →Method
- 14:3214:32, 17 October 2014 diff hist +1 Bounded monotonous priority queue →General information
- 14:2714:27, 17 October 2014 diff hist +77 Dial implementation →Methods
- 14:2514:25, 17 October 2014 diff hist −12 Dial implementation →General information
- 14:1914:19, 17 October 2014 diff hist +3 Dijkstra →Further infromation
- 14:1914:19, 17 October 2014 diff hist +716 Dijkstra →Further infromation
14 October 2014
- 10:5110:51, 14 October 2014 diff hist +40 Strongly connected components No edit summary
- 10:4310:43, 14 October 2014 diff hist +11 Dial implementation →General information
- 05:0005:00, 14 October 2014 diff hist −17 Dial implementation →General information
13 October 2014
- 16:1216:12, 13 October 2014 diff hist +1 Three indians' algorithm →Remarks
- 15:5315:53, 13 October 2014 diff hist +109 Three indians' algorithm →Induction basis
- 15:3815:38, 13 October 2014 diff hist +624 N Three indians' algorithm Created page with "== General information == '''Algorithmic problem:''' Blocking flow. '''Type of algorithm:''' loop. == Abstract view == '''Invariant:''' The current flow is feasible...."
- 15:2915:29, 13 October 2014 diff hist +85 Blocking flow →Output
- 15:2815:28, 13 October 2014 diff hist +270 N Blocking flow Created page with "== Input == # A directed graph <math>G=(V,A)</math>. # Source <math>s\in V</math> and target <math>t\in V</math>. # An upper boud <math>u(a)</math> for each arc <math>a\in A<..."
- 15:2415:24, 13 October 2014 diff hist +1 Dinic →Induction step
- 13:5713:57, 13 October 2014 diff hist +873 Dinic No edit summary
- 13:4813:48, 13 October 2014 diff hist +23 Dinic →Induction step
- 13:4713:47, 13 October 2014 diff hist +85 Dinic →General Information
- 13:4613:46, 13 October 2014 diff hist +21 Dinic →Induction step
- 13:4313:43, 13 October 2014 diff hist +1 Dinic →Induction step
- 13:4213:42, 13 October 2014 diff hist +416 Dinic →Induction step
- 13:3513:35, 13 October 2014 diff hist +22 Dinic No edit summary
- 13:3213:32, 13 October 2014 diff hist +1 Basic flow definitions →Valid distance labeling
- 13:3113:31, 13 October 2014 diff hist +640 Basic flow definitions No edit summary
- 13:1313:13, 13 October 2014 diff hist +1 Dinic →Abstract View
- 13:1313:13, 13 October 2014 diff hist +1 Dinic →Induction basis
- 13:1213:12, 13 October 2014 diff hist +160 Dinic No edit summary
- 13:0013:00, 13 October 2014 diff hist +413 N Dinic Created page with "== General Information == '''Algorithmic problem:''' Max-Flow Problems '''Type of algorithm :''' loop. == Abstract View == '''Invariant:''' After <math>i \ge 0</math>..."
- 12:5112:51, 13 October 2014 diff hist +1 Ahuja-Orlin →Complexity
- 12:5112:51, 13 October 2014 diff hist +160 Ahuja-Orlin →Complexity
- 12:4912:49, 13 October 2014 diff hist +535 Ahuja-Orlin No edit summary
- 12:4512:45, 13 October 2014 diff hist +199 Ahuja-Orlin →Complexity
- 12:4312:43, 13 October 2014 diff hist +10 Ahuja-Orlin →Complexity
- 12:4212:42, 13 October 2014 diff hist 0 Ahuja-Orlin →Complexity
- 12:2912:29, 13 October 2014 diff hist +1 Ahuja-Orlin →Complexity
- 12:2812:28, 13 October 2014 diff hist −1 Ahuja-Orlin →Complexity
- 12:2712:27, 13 October 2014 diff hist +1 Ahuja-Orlin →Complexity
- 12:2712:27, 13 October 2014 diff hist −2 Ahuja-Orlin →Complexity
- 12:2612:26, 13 October 2014 diff hist −2 Ahuja-Orlin →Induction step
- 12:2612:26, 13 October 2014 diff hist +3 Ahuja-Orlin →Induction step
- 12:2512:25, 13 October 2014 diff hist +1 Ahuja-Orlin →Induction step
- 12:2512:25, 13 October 2014 diff hist −4 Ahuja-Orlin →Induction step
- 12:2512:25, 13 October 2014 diff hist +1 Ahuja-Orlin →Complexity
- 12:2412:24, 13 October 2014 diff hist +1 Ahuja-Orlin →Complexity
- 12:2412:24, 13 October 2014 diff hist +1 Ahuja-Orlin →Complexity
- 12:2412:24, 13 October 2014 diff hist +150 Ahuja-Orlin No edit summary
- 12:2012:20, 13 October 2014 diff hist +12 Ahuja-Orlin →Complexity
- 12:1912:19, 13 October 2014 diff hist −1 Ahuja-Orlin →Complexity
- 12:1912:19, 13 October 2014 diff hist +210 Ahuja-Orlin →Complexity
- 12:1612:16, 13 October 2014 diff hist +35 Ahuja-Orlin →Complexity
- 12:1512:15, 13 October 2014 diff hist +1 Ahuja-Orlin →Complexity
- 12:1412:14, 13 October 2014 diff hist +741 Ahuja-Orlin →Complexity
- 12:0612:06, 13 October 2014 diff hist −23 Ahuja-Orlin →Induction step
- 12:0612:06, 13 October 2014 diff hist +1 Ahuja-Orlin →Induction step
- 12:0612:06, 13 October 2014 diff hist 0 Ahuja-Orlin →Induction step
- 12:0512:05, 13 October 2014 diff hist +1 Ahuja-Orlin →Induction step
- 12:0512:05, 13 October 2014 diff hist +46 Ahuja-Orlin →Induction step
- 12:0412:04, 13 October 2014 diff hist +1 Ahuja-Orlin →Complexity
- 11:5711:57, 13 October 2014 diff hist +203 Ahuja-Orlin →Complexity
- 11:4811:48, 13 October 2014 diff hist +302 Ahuja-Orlin →Complexity
- 11:4311:43, 13 October 2014 diff hist +15 Ahuja-Orlin →Abstract View
- 11:4311:43, 13 October 2014 diff hist +154 Ahuja-Orlin →Complexity
- 11:3911:39, 13 October 2014 diff hist +26 Ahuja-Orlin →Abstract View
- 11:3811:38, 13 October 2014 diff hist +42 Ahuja-Orlin →Complexity
- 11:3611:36, 13 October 2014 diff hist +88 Ahuja-Orlin →Induction step
- 11:3411:34, 13 October 2014 diff hist +104 Ahuja-Orlin →Induction step
- 11:3011:30, 13 October 2014 diff hist +24 Ahuja-Orlin →Induction step
- 11:2811:28, 13 October 2014 diff hist +13 Ahuja-Orlin →Induction step
- 11:2511:25, 13 October 2014 diff hist +28 Ahuja-Orlin →Induction basis
- 11:2211:22, 13 October 2014 diff hist +177 Ahuja-Orlin →Induction step
- 11:2111:21, 13 October 2014 diff hist −6 Ahuja-Orlin →Induction basis
- 11:1611:16, 13 October 2014 diff hist +239 Ahuja-Orlin →Induction step
- 11:1011:10, 13 October 2014 diff hist +1 Basic flow definitions →Residual network
- 11:1011:10, 13 October 2014 diff hist +38 Basic flow definitions →Residual network
- 11:1011:10, 13 October 2014 diff hist +1 Basic flow definitions →Residual network
- 11:0911:09, 13 October 2014 diff hist +34 Basic flow definitions →Residual network
- 11:0911:09, 13 October 2014 diff hist +141 Basic flow definitions →Residual network
- 11:0711:07, 13 October 2014 diff hist +581 Basic flow definitions →Valid distance labeling
- 10:4910:49, 13 October 2014 diff hist −1 Ahuja-Orlin →Induction step
- 10:4910:49, 13 October 2014 diff hist −5 Ahuja-Orlin →Induction step
- 10:4710:47, 13 October 2014 diff hist +466 Ahuja-Orlin →Induction step
- 10:3110:31, 13 October 2014 diff hist +21 Ahuja-Orlin →Abstract View
- 10:2710:27, 13 October 2014 diff hist +267 Ahuja-Orlin →Induction basis
- 10:1210:12, 13 October 2014 diff hist +546 Ahuja-Orlin →Induction basis
- 10:0210:02, 13 October 2014 diff hist +87 Ahuja-Orlin →Abstract View
- 09:4709:47, 13 October 2014 diff hist +6 Ahuja-Orlin →Abstract View
- 09:4709:47, 13 October 2014 diff hist +1 Ahuja-Orlin →Abstract View
- 09:4509:45, 13 October 2014 diff hist +24 Ahuja-Orlin No edit summary
- 09:4209:42, 13 October 2014 diff hist +45 Edmonds-Karp →Complexity
- 09:4109:41, 13 October 2014 diff hist +1 Edmonds-Karp →Complexity
- 09:3909:39, 13 October 2014 diff hist +1 Edmonds-Karp →Complexity
- 09:3709:37, 13 October 2014 diff hist 0 Edmonds-Karp →Complexity
- 09:3709:37, 13 October 2014 diff hist +32 Edmonds-Karp →Complexity
- 09:3609:36, 13 October 2014 diff hist 0 Edmonds-Karp →Complexity
- 09:3509:35, 13 October 2014 diff hist −266 Edmonds-Karp →Complexity
- 09:2309:23, 13 October 2014 diff hist +526 Edmonds-Karp →Complexity
- 09:0209:02, 13 October 2014 diff hist +50 Edmonds-Karp →Complexity
- 08:4808:48, 13 October 2014 diff hist +381 Edmonds-Karp →Complexity
- 06:4506:45, 13 October 2014 diff hist +63 Ahuja-Orlin No edit summary
- 06:4106:41, 13 October 2014 diff hist +1 Ahuja-Orlin →Abstract View
- 06:4106:41, 13 October 2014 diff hist +13 Ahuja-Orlin →Abstract View
- 06:3706:37, 13 October 2014 diff hist +313 Ahuja-Orlin →Abstract View
- 06:2506:25, 13 October 2014 diff hist +998 N Ahuja-Orlin Created page with "== General Information == '''Algorithmic problem:''' Max-Flow Problems '''Type of algorithm:''' loop == Abstract View == '''Invariant:''' After <math>i \ge 0</math> it..."
12 October 2014
- 20:3020:30, 12 October 2014 diff hist +1 Edmonds-Karp →Complexity
- 20:3020:30, 12 October 2014 diff hist +1 Edmonds-Karp →Complexity
- 20:2920:29, 12 October 2014 diff hist +1 Edmonds-Karp →Complexity
- 20:2920:29, 12 October 2014 diff hist −1 Edmonds-Karp →Complexity
- 20:2920:29, 12 October 2014 diff hist +771 Edmonds-Karp →Complexity
- 20:2020:20, 12 October 2014 diff hist +414 Edmonds-Karp →Complexity
- 20:1220:12, 12 October 2014 diff hist +101 Edmonds-Karp →Complexity
- 20:0620:06, 12 October 2014 diff hist +468 Edmonds-Karp →Complexity
- 19:5319:53, 12 October 2014 diff hist +349 Edmonds-Karp →Complexity
- 19:4919:49, 12 October 2014 diff hist +206 Edmonds-Karp No edit summary
- 19:4719:47, 12 October 2014 diff hist +126 Edmonds-Karp →General Information
- 19:4519:45, 12 October 2014 diff hist +21 Edmonds-Karp →Abstract View
- 19:4419:44, 12 October 2014 diff hist +778 N Edmonds-Karp Created page with "== General Information == '''Algorithmic problem:''' Max-Flow Problems <br> '''Type of algorithm:''' loop<br> ' == Abstract View == '''Invariant:''' After <math>i \ge..."
- 19:3419:34, 12 October 2014 diff hist −1 Ford-Fulkerson →Abstract View
- 19:3319:33, 12 October 2014 diff hist +81 Ford-Fulkerson →Abstract View
- 19:3119:31, 12 October 2014 diff hist +5 Ford-Fulkerson →Complexity
- 19:3019:30, 12 October 2014 diff hist +8 Ford-Fulkerson →Complexity
- 19:2919:29, 12 October 2014 diff hist +1 Ford-Fulkerson →Induction Step
- 19:2919:29, 12 October 2014 diff hist +10 Ford-Fulkerson →Induction Step
- 19:2819:28, 12 October 2014 diff hist −43 Ford-Fulkerson →General Information
- 19:2719:27, 12 October 2014 diff hist −2 Basic flow definitions →Preflow
- 19:2719:27, 12 October 2014 diff hist +318 Basic flow definitions →Preflow
- 19:2319:23, 12 October 2014 diff hist +1 Basic flow definitions →Flow-augmenting path
- 19:2219:22, 12 October 2014 diff hist +621 Basic flow definitions →Flow-augmenting path
- 19:0419:04, 12 October 2014 diff hist +255 Basic flow definitions →Residual network
- 18:5518:55, 12 October 2014 diff hist +1 Basic flow definitions →Residual network
- 18:5418:54, 12 October 2014 diff hist +470 Basic flow definitions →Residual network
- 18:4718:47, 12 October 2014 diff hist +1 Basic flow definitions →Residual network
- 17:0117:01, 12 October 2014 diff hist +300 Basic flow definitions No edit summary
- 16:5816:58, 12 October 2014 diff hist +90 N Basic flow definitions Created page with "# Residual network # Flow-augmenting path # Preflow # Pseudoflow # Valid distance labeling"
- 16:5716:57, 12 October 2014 diff hist +27 Ford-Fulkerson →Induction Step
- 16:5616:56, 12 October 2014 diff hist −49 Max-Flow Problems No edit summary
- 16:5616:56, 12 October 2014 diff hist +24 Max-Flow Problems →Basic definitions
- 16:5616:56, 12 October 2014 diff hist +25 Max-Flow Problems No edit summary
- 16:5416:54, 12 October 2014 diff hist 0 Ford-Fulkerson →Induction Step
- 16:3216:32, 12 October 2014 diff hist +5 Max-Flow Problems →Generalizations
- 16:3116:31, 12 October 2014 diff hist +359 Max-Flow Problems →Generalizations
- 10:2910:29, 12 October 2014 diff hist +72 Classical eulerian cycle algorithm →Complexity
- 10:2810:28, 12 October 2014 diff hist +33 Classical eulerian cycle algorithm →Complexity
- 10:2710:27, 12 October 2014 diff hist −2 Classical eulerian cycle algorithm →Complexity
- 10:2710:27, 12 October 2014 diff hist +352 Classical eulerian cycle algorithm →Complexity
- 10:1710:17, 12 October 2014 diff hist +15 Classical eulerian cycle algorithm →Induction step
- 10:1710:17, 12 October 2014 diff hist −7 Classical eulerian cycle algorithm →Induction step
- 10:1610:16, 12 October 2014 diff hist −3 Classical eulerian cycle algorithm →Correctness
- 10:1510:15, 12 October 2014 diff hist +5 Classical eulerian cycle algorithm →Correctness
- 10:1410:14, 12 October 2014 diff hist +1 Classical eulerian cycle algorithm →Correctness
- 10:1410:14, 12 October 2014 diff hist −4 Classical eulerian cycle algorithm →Correctness
- 10:1410:14, 12 October 2014 diff hist +1 Classical eulerian cycle algorithm →Correctness
- 10:1310:13, 12 October 2014 diff hist 0 Classical eulerian cycle algorithm →Correctness
- 10:1310:13, 12 October 2014 diff hist +130 Classical eulerian cycle algorithm →Correctness
- 10:1110:11, 12 October 2014 diff hist +909 Classical eulerian cycle algorithm No edit summary
- 09:5109:51, 12 October 2014 diff hist +29 Eulerian cycle →Input
- 09:5009:50, 12 October 2014 diff hist +878 Classical eulerian cycle algorithm →Induction step
- 09:2209:22, 12 October 2014 diff hist +67 Eulerian cycle →Output
- 09:0909:09, 12 October 2014 diff hist −118 Classical eulerian cycle algorithm →Induction basis
- 09:0909:09, 12 October 2014 diff hist +75 Classical eulerian cycle algorithm →General information
- 09:0809:08, 12 October 2014 diff hist +184 Classical eulerian cycle algorithm →General information
- 09:0709:07, 12 October 2014 diff hist +20 Classical eulerian cycle algorithm →Induction step
- 09:0609:06, 12 October 2014 diff hist +31 Classical eulerian cycle algorithm →Complexity
- 09:0509:05, 12 October 2014 diff hist +16 Classical eulerian cycle algorithm →Remark
- 09:0509:05, 12 October 2014 diff hist +1 Classical eulerian cycle algorithm →Remark
- 09:0509:05, 12 October 2014 diff hist +1 Classical eulerian cycle algorithm →Complexity
- 09:0409:04, 12 October 2014 diff hist +1 Classical eulerian cycle algorithm →Complexity
- 09:0409:04, 12 October 2014 diff hist +432 Classical eulerian cycle algorithm No edit summary
- 08:3608:36, 12 October 2014 diff hist +109 Classical eulerian cycle algorithm →Induction step
- 08:3508:35, 12 October 2014 diff hist +62 Classical eulerian cycle algorithm →General information
- 08:3408:34, 12 October 2014 diff hist +200 N Classical eulerian cycle algorithm Created page with "== General information == '''Algorithmic problem:''' Eulerian cycle ''' Type of algorithm:''' recursion == Induction step == '''Abstract view:''' The output sequence o..."
- 08:3208:32, 12 October 2014 diff hist +437 N Eulerian cycle Created page with "== Definition == A '''Eulerian cycle''' is a cycle in a directed or undirected graph that contains each edge/arc exactly once. Redundant information for clarification: In th..."
- 08:2508:25, 12 October 2014 diff hist −1 Branching by Edmonds →Induction step
- 08:2408:24, 12 October 2014 diff hist 0 Branching by Edmonds →Induction step
- 08:2308:23, 12 October 2014 diff hist +1 Branching by Edmonds →Induction step
- 08:2308:23, 12 October 2014 diff hist +1 Branching by Edmonds →Induction step
- 08:2208:22, 12 October 2014 diff hist +10 Branching by Edmonds →Induction step
- 08:2108:21, 12 October 2014 diff hist +1 Branching by Edmonds →Induction step
- 08:2108:21, 12 October 2014 diff hist +2 Branching by Edmonds →Induction step
- 08:1708:17, 12 October 2014 diff hist −765 Branching by Edmonds →Induction step
- 07:5807:58, 12 October 2014 diff hist +175 Branching by Edmonds →Induction step