Jump to content

Dinic's algorithm: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

24 December 2023

23 December 2023

22 December 2023

19 July 2023

11 July 2023

14 May 2023

4 May 2023

23 February 2023

3 November 2022

14 October 2022

8 November 2021

18 July 2021

4 July 2021

3 July 2021

15 April 2021

18 December 2020

17 November 2020

16 November 2020

13 September 2020

25 July 2020

6 December 2019

  • curprev 04:0504:05, 6 December 2019108.48.121.215 talk 9,953 bytes −35 →‎Definition: Remove line 14 (:#: <math>c_f(v,u) = f(u,v)</math>) because it is incorrect: c_f(v, u) = c(v, u) - f(v, u) = c(v, u) + f(u, v). It implicitly assumes that c(v, u) = 0 which is equivalent to assuming that if (u, v) is in E then (v, u) is not in E. Consider a graph with edges (u, v) and (v, u). The current text defines c_f(v, u) incorrectly, V x V already includes the case (v, u) and covers its value correctly if the line is deleted.. undo

27 June 2019

25 April 2019

21 October 2018

21 February 2018

11 February 2018

12 January 2018

9 January 2018

3 January 2018

18 November 2017

2 October 2017

3 August 2017

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)