Search results
Jump to navigation
Jump to search
- * The number of unrooted labelled trees with <math>n</math> vertices of degrees <math>d_1,d_2,\dots,d_n</math> resp ...5 KB (845 words) - 13:06, 14 May 2024
- ...''(<math>\phi</math>) can be described by at most <math>n</math> recursion trees. ::Fix a <math>\phi</math>. The <math>n</math> recursion trees which capture the total running history of '''Solve'''(<math>\phi</math>) c ...31 KB (5,614 words) - 12:29, 8 December 2015
- ** [http://en.wikipedia.org/wiki/Prüfer_sequence Prüfer code for trees] ...10 KB (987 words) - 17:13, 14 May 2024
- ** [http://en.wikipedia.org/wiki/Prüfer_sequence Prüfer code for trees] ...9 KB (998 words) - 05:12, 11 June 2014
- ** [http://en.wikipedia.org/wiki/Prüfer_sequence Prüfer code for trees] ...11 KB (1,243 words) - 12:46, 15 September 2017
- ** [http://en.wikipedia.org/wiki/Prüfer_sequence Prüfer code for trees] ...11 KB (1,070 words) - 12:46, 15 September 2017
- These combinatorial games can be represented by trees, each vertex of which is the game resulting from a particular move from the ...6 KB (1,097 words) - 23:35, 19 September 2015
- ** [http://en.wikipedia.org/wiki/Prüfer_sequence Prüfer code for trees] ...11 KB (1,223 words) - 07:38, 2 January 2018
- ...''(<math>\phi</math>) can be described by at most <math>n</math> recursion trees. ::Fix a <math>\phi</math>. The <math>n</math> recursion trees which capture the total running history of '''Solve'''(<math>\phi</math>) c ...33 KB (6,039 words) - 08:41, 7 June 2010
- ** [http://en.wikipedia.org/wiki/Prüfer_sequence Prüfer code for trees] ...12 KB (1,290 words) - 06:43, 27 December 2019
- ...j8j384065436q61/<nowiki>[Knu71]</nowiki> D.E. Knuth. Optimum binary search trees. Acta Informatica， 1(1):14{25， 1971.] ...17 KB (967 words) - 06:08, 9 November 2010
- ** [http://en.wikipedia.org/wiki/Prüfer_sequence Prüfer code for trees] ...14 KB (1,438 words) - 18:58, 9 April 2024
- ...se an efficient randomized algorithm for testing the isomorphism of rooted trees and analyze its performance. '''''Hint:''''' Recursively associate a polyno ...22 KB (3,823 words) - 14:12, 15 November 2023
- ...roblem can be solved by binary search on a sorted table or balanced search trees in <math>O(\log n)</math> time for a set <math>S</math> of <math>n</math> e ...10 KB (1,895 words) - 06:20, 21 November 2011
- ...2 of [https://rdlyons.pages.iu.edu/prbtree/book_online.pdf Probability on Trees and Networks] by Lyons and Peres ...13 KB (1,427 words) - 15:57, 9 January 2024
- ...ldren.) It follows that ''C''<sub>''n''</sub> is the number of full binary trees with ''n'' + 1 leaves: ...20 KB (3,444 words) - 04:53, 7 October 2010
- ...ldren.) It follows that ''C''<sub>''n''</sub> is the number of full binary trees with ''n'' + 1 leaves: ...24 KB (4,298 words) - 05:54, 20 March 2013
- ...ldren.) It follows that ''C''<sub>''n''</sub> is the number of full binary trees with ''n'' + 1 leaves: ...24 KB (4,298 words) - 06:51, 26 February 2014
- ...ldren.) It follows that ''C''<sub>''n''</sub> is the number of full binary trees with ''n'' + 1 leaves: ...24 KB (4,338 words) - 12:57, 11 September 2016
- ...ldren.) It follows that ''C''<sub>''n''</sub> is the number of full binary trees with ''n'' + 1 leaves: ...24 KB (4,338 words) - 13:15, 6 September 2019