Jump to content

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

17 October 2024

12 October 2024

1 August 2024

6 April 2023

29 January 2023

21 June 2022

2 November 2021

23 May 2021

10 December 2020

13 April 2020

10 April 2019

16 October 2018

  • curprev 10:3010:30, 16 October 2018 2a00:8a60:c000:1:50ce:ee4c:333f:a332 talk 10,359 bytes +27 The referenced article for caterpilar tree uses a different definition than the mentioned paper. The definition from the other article allows for a very simple algorithm. The bandwidth of such a caterpilar tree according to the algorithm is just maximum degree + 1. undo

1 September 2018

16 May 2018

12 February 2016

5 February 2016

28 September 2015

4 September 2015

29 August 2015

18 January 2015

17 January 2015

20 October 2014

28 July 2014

31 May 2014

5 May 2014

20 April 2014

29 March 2014

8 March 2014

4 March 2014

7 August 2013

3 August 2013

14 June 2013

14 May 2013

31 December 2012

30 December 2012

9 August 2012

10 May 2012

30 December 2011

8 November 2011

20 August 2011

16 June 2011

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