Jump to content

Distributed minimum spanning tree: 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)

30 December 2024

20 December 2024

28 May 2024

1 January 2023

25 November 2022

17 April 2022

9 August 2019

7 July 2019

15 May 2018

29 November 2017

9 January 2017

  • curprev 10:5910:59, 9 January 2017 149.156.69.249 talk 14,468 bytes +2 Changed lower bound of the time complexity according to the cited article: David Peleg and Vitaly Rubinovich “A near tight lower bound on the time complexity of Distributed Minimum Spanning Tree Construction.“. undo

17 February 2015

13 September 2013

12 September 2013

11 September 2013

15 March 2013

14 March 2013

5 March 2013

16 August 2012

10 July 2012

20 April 2012

19 March 2012

8 March 2012

19 December 2011

18 December 2011

17 December 2011

15 June 2010

12 May 2010

11 May 2010

16 December 2009

31 August 2009

11 July 2009

18 April 2009

25 March 2009

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