User contributions for BB91
Jump to navigation
Jump to search
20 February 2015
- 14:3714:37, 20 February 2015 diff hist +85 m Successive shortest paths →Abstract view: Vereinheitlichung Seitenaufbau
- 14:0614:06, 20 February 2015 diff hist 0 Successive shortest paths →Induction step: Hier muss Zykel C gemeint sein, damit Beweis Sinn ergibt
17 February 2015
- 13:1213:12, 17 February 2015 diff hist 0 m Preflow-push →Induction step: intuitivere Benennung
16 February 2015
5 February 2015
- 15:1815:18, 5 February 2015 diff hist 0 m Negative cycle-canceling →Induction step current
4 February 2015
- 18:0318:03, 4 February 2015 diff hist −84 Preflow-push Undo revision 2789 by BB91 (talk) wird in vielen anderen Artikeln als O(n^2) benötigt
- 17:5617:56, 4 February 2015 diff hist −4 m FIFO preflow-push →Complexity
- 17:3417:34, 4 February 2015 diff hist +9 Preflow-push →Abstract view: current arc muss im Residualgraph sein
- 17:3117:31, 4 February 2015 diff hist +84 Preflow-push →Complexity: Korrektur der Anzahl an Vorwärtsschritten der current arc
3 February 2015
- 19:3219:32, 3 February 2015 diff hist +4 m Preflow-push →Induction step
8 January 2015
- 10:4310:43, 8 January 2015 diff hist +1 m Dinic →Induction step: auch V wird i.A. reduziert current
3 January 2015
- 09:2909:29, 3 January 2015 diff hist +38 m Max-flow min-cut →Proof current
- 09:2709:27, 3 January 2015 diff hist +308 Max-flow min-cut →Proof: Konkretisierung der Formulierung + Links eingefügt
- 09:1909:19, 3 January 2015 diff hist +38 m Max-flow min-cut No edit summary
2 January 2015
- 16:1816:18, 2 January 2015 diff hist 0 Max-Flow Problems Undo revision 2722 by BB91 (talk) Irrtum
- 16:0516:05, 2 January 2015 diff hist 0 Max-Flow Problems →Generalizations: Hilfskapazitäten
- 11:1911:19, 2 January 2015 diff hist +44 m Branching by Edmonds →Recursive step
- 11:0911:09, 2 January 2015 diff hist +102 Branching by Edmonds →Recursive step: Tipp zur Veranschaulichung
- 11:0111:01, 2 January 2015 diff hist −90 Branching by Edmonds →Recursive step: bereits in Vereinigung der p_i liegt der Zykel
- 10:4410:44, 2 January 2015 diff hist +1 m Branching by Edmonds →Recursive step
- 10:4110:41, 2 January 2015 diff hist −1 m Branching by Edmonds →Recursive step
- 10:2110:21, 2 January 2015 diff hist +1 m Branching by Edmonds →Recursive step
- 10:1210:12, 2 January 2015 diff hist +1 m Branching by Edmonds →Recursive step: B -> B'
- 08:1008:10, 2 January 2015 diff hist +23 Classical eulerian cycle algorithm →Correctness: kleine Einfügung zum Verständnis; Korrektur tail -> beginning node im Beweis
1 January 2015
- 17:4317:43, 1 January 2015 diff hist +248 Hopcroft-Tarjan →Step 2: Behandlung von besonderen Artikulationsknoten
- 17:3117:31, 1 January 2015 diff hist +941 Hopcroft-Tarjan →Step 2: Behandlung von besonderen Artikulationsknoten
- 16:3616:36, 1 January 2015 diff hist +23 Hopcroft-Tarjan →Step 1: Berichtigung der Definition von "lowpoint"
30 December 2014
- 14:4014:40, 30 December 2014 diff hist +246 Kosaraju →Correctness
- 14:1914:19, 30 December 2014 diff hist +91 Kosaraju →Correctness
- 14:1714:17, 30 December 2014 diff hist −201 Kosaraju →Correctness
- 09:5509:55, 30 December 2014 diff hist +1 Depth-first search →Abstract view
28 December 2014
- 14:1714:17, 28 December 2014 diff hist +53 Bounded priority queue No edit summary
- 14:0814:08, 28 December 2014 diff hist +17 Bounded priority queue No edit summary
23 December 2014
- 14:2014:20, 23 December 2014 diff hist +51 Preflow-push →Induction basis
20 December 2014
- 10:3610:36, 20 December 2014 diff hist +43 Preflow-push →Induction basis
- 10:3210:32, 20 December 2014 diff hist 0 Basic flow definitions →Preflow
27 November 2014
- 16:2416:24, 27 November 2014 diff hist +15 Hopcroft-Tarjan →Step 1
18 November 2014
- 11:2811:28, 18 November 2014 diff hist +20 Main Page →Flow Algorithms
- 11:2411:24, 18 November 2014 diff hist +49 Main Page →To Do
17 November 2014
- 20:1220:12, 17 November 2014 diff hist +369 Directed graph →Definition current
- 19:5319:53, 17 November 2014 diff hist +536 N K-partite graph Created page with "==Definition== An undirected graph <math>G=(V,E)</math> is called '''k-partite''', if there is a partition of <math>V</math>, hereinafter referred to as <math>V=\dot\cup_{i=1..." current
16 November 2014
9 November 2014
- 14:5914:59, 9 November 2014 diff hist +99 Kosaraju →Correctness
- 14:5214:52, 9 November 2014 diff hist 0 N File:CondensedGraphKosaraju.jpg No edit summary current
- 14:0814:08, 9 November 2014 diff hist +151 Kosaraju →Correctness
- 13:2913:29, 9 November 2014 diff hist +5 Breadth-first search →Induction basis
- 13:0413:04, 9 November 2014 diff hist +1 Depth-first search →Complexity
- 12:5912:59, 9 November 2014 diff hist +1 Depth-first search →Induction step
- 12:4812:48, 9 November 2014 diff hist +93 Depth-first search →Abstract view
3 November 2014
- 11:1411:14, 3 November 2014 diff hist +9 Dial implementation →Methods