Jump to content

Graph canonization: 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)

31 May 2025

30 May 2025

25 October 2024

1 August 2024

7 June 2024

4 January 2024

16 December 2023

27 November 2023

7 November 2023

1 April 2023

30 January 2023

28 December 2021

6 December 2021

6 August 2021

24 March 2019

3 December 2018

29 November 2018

23 July 2018

13 December 2017

31 July 2017

22 June 2017

30 October 2016

29 June 2016

30 January 2016

21 September 2015

26 May 2015

2 April 2015

22 January 2015

26 August 2014

  • curprev 23:5823:58, 26 August 2014 Ynaamad talk contribs 7,078 bytes +84 Clarified how the randomness works. As written, it suggested that there is a PPT algorithm for canonicalization, and therefore for isomorphism. Instead, the randomness is quantified over graphs chosen from the uniform distribution, not the worst one. undo

7 June 2014

6 June 2014

22 March 2014

26 March 2013

19 March 2013

1 March 2013

5 December 2012

10 November 2012

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