Search results
Jump to navigation
Jump to search
- Two ''rooted'' trees <math>T_1</math> and <math>T_2</math> are said to be '''isomorphic''' if th ...d one-sided error (false positive), for testing isomorphism between rooted trees with <math>n</math> vertices. Analyze your algorithm. ...2 KB (406 words) - 14:53, 22 September 2018
- We now present a theorem of the number of labeled trees on a fixed number of vertices. It is due to [http://en.wikipedia.org/wiki/A {{Theorem|Cayley's formula for trees| ...17 KB (3,190 words) - 12:43, 18 April 2013
- We now present a theorem of the number of labeled trees on a fixed number of vertices. It is due to [http://en.wikipedia.org/wiki/A {{Theorem|Cayley's formula for trees| ...17 KB (3,190 words) - 11:36, 13 April 2023
- We now present a theorem of the number of labeled trees on a fixed number of vertices. It is due to [http://en.wikipedia.org/wiki/A {{Theorem|Cayley's formula for trees| ...17 KB (3,190 words) - 05:36, 23 October 2017
- We now present a theorem of the number of labeled trees on a fixed number of vertices. It is due to [http://en.wikipedia.org/wiki/A {{Theorem|Cayley's formula for trees| ...17 KB (3,190 words) - 05:31, 19 March 2014
- We now present a theorem of the number of labeled trees on a fixed number of vertices. It is due to [http://en.wikipedia.org/wiki/A {{Theorem|Cayley's formula for trees| ...17 KB (3,190 words) - 04:35, 17 October 2016
- We now present a theorem of the number of labeled trees on a fixed number of vertices. It is due to [http://en.wikipedia.org/wiki/A {{Theorem|Cayley's formula for trees| ...17 KB (3,190 words) - 07:11, 14 October 2019
- We now present a theorem of the number of labeled trees on a fixed number of vertices. It is due to [http://en.wikipedia.org/wiki/A {{Theorem|Cayley's formula for trees| ...17 KB (3,190 words) - 13:26, 9 April 2024
- We now present a theorem of the number of labeled trees on a fixed number of vertices. It is due to [http://en.wikipedia.org/wiki/A {{Theorem|Cayley's formula for trees| ...17 KB (3,190 words) - 03:55, 27 October 2015
- ...ling algorithms such as the "cycle-popping" algorithm for uniform spanning trees by Wilson. Among other applications, we discover new algorithms to sample s ...ation of SDDM Matrices with Applications to Counting and Sampling Spanning Trees</font> ...7 KB (999 words) - 05:35, 13 July 2017
- [[File:Arbres.jpg|thumb|right|250px|Trees around a lake]] A '''tree''' is a tall [[plant]] with a trunk and branches made of [[wood]]. Trees can live for many years. The oldest tree ever discovered is approximately 5 ...22 KB (3,388 words) - 03:21, 26 August 2017
- We now present a theorem of the number of labeled trees on a fixed number of vertices. It is due to [http://en.wikipedia.org/wiki/A {{Theorem|Cayley's formula for trees| ...21 KB (3,832 words) - 15:23, 7 October 2011
- Two ''rooted'' trees <math>T_1</math> and <math>T_2</math> are said to be '''isomorphic''' if th ...ed one-side error (false positive), for testing isomorphism between rooted trees with <math>n</math> vertices. Analyze your algorithm. ...6 KB (1,047 words) - 05:03, 24 September 2019
- ...''(<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 ...16 KB (2,926 words) - 04:01, 24 July 2011
- We now present a theorem of the number of labeled trees on a fixed number of vertices. It is due to [http://en.wikipedia.org/wiki/A {{Theorem|Caylay's formula for trees| ...26 KB (4,583 words) - 04:53, 7 October 2010
- Two ''rooted'' trees <math>T_1</math> and <math>T_2</math> are said to be '''isomorphic''' if th ...d one-sided error (false positive), for testing isomorphism between rooted trees with <math>n</math> vertices. Analyze your algorithm. ...10 KB (1,800 words) - 14:47, 20 September 2017
- ...Todorčević along with Abraham had proved the existence of rigid Aronszajn trees and the consistency of <math>MA + \neg CH</math> + there exists a first cou ...nsistent possibilities for various types of trees, looking for results for trees on multiple cardinals, or with required or forbidden types of subtrees. The ...16 KB (2,241 words) - 05:01, 18 January 2017
- ...''(<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 ...24 KB (4,382 words) - 10:07, 24 May 2013
- ...''(<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 ...24 KB (4,382 words) - 07:27, 21 April 2014
- * 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) - 02:38, 10 April 2024
- * 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
- ...ldren.) It follows that ''C''<sub>''n''</sub> is the number of full binary trees with ''n'' + 1 leaves: ...24 KB (4,338 words) - 09:04, 12 September 2017
- ...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:04, 14 September 2015
- ...ldren.) It follows that ''C''<sub>''n''</sub> is the number of full binary trees with ''n'' + 1 leaves: ...24 KB (4,348 words) - 11:46, 6 March 2013
- ...ldren.) It follows that ''C''<sub>''n''</sub> is the number of full binary trees with ''n'' + 1 leaves: ...25 KB (4,460 words) - 17:41, 23 March 2023
- ...ldren.) It follows that ''C''<sub>''n''</sub> is the number of full binary trees with ''n'' + 1 leaves: ...25 KB (4,460 words) - 11:41, 6 March 2024
- ...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 ...31 KB (5,704 words) - 05:36, 13 November 2015
- ...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 ...31 KB (5,704 words) - 08:39, 5 May 2014
- ...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 ...37 KB (6,743 words) - 09:07, 13 November 2011
- ...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 ...38 KB (6,912 words) - 15:45, 3 October 2022
- ...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 ...39 KB (7,106 words) - 09:54, 24 May 2013
- ...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 ...42 KB (7,662 words) - 08:41, 7 June 2010
- ...ombinatorial objects with some particular structure, such as the number of trees, or Latin squares. The '''#P''' class contains the counting problems that t ...37 KB (6,579 words) - 08:26, 7 June 2010