Search results

Page title matches

• B-Trees
  20 bytes (2 words) - 08:15, 5 October 2014
• Union-find with disjoint trees
  135 bytes (19 words) - 22:04, 6 October 2014

Page text matches

• Binary search tree
  [[Category:Trees]] ...search tree. In accordance with the definition of [[Directed Tree|directed trees]], "well-formed" means that, for any node, there is exactly one [[Basic gra
  2 KB (353 words) - 06:14, 6 July 2015
• Decision Tree
  [[Category:Trees]]
  109 bytes (11 words) - 17:39, 10 September 2014
• B-tree: shift key to sibling
  '''Algorithmic problem:''' [[B-Trees|See B-Trees]] # In the case <math>p.n < 2M</math>, all implementation invariants of B-trees are maintained if the following <math>K'</math> can be inserted at some pos
  4 KB (708 words) - 23:17, 19 June 2015
• Minimum spanning tree
  An [[Basic graph definitions#Forests, trees, branchings, arborescences|undirected tree]] <math> T= (V,E_F)</math> such
  539 bytes (79 words) - 12:33, 16 June 2015
• Maximum spanning forest
  An [[Basic graph definitions#Forests, trees, branchings, arborescences|undirected forest]] <math> F= (V,E_F)</math> suc
  540 bytes (79 words) - 18:03, 18 September 2015
• B-tree
  # A B-tree of order <math>M</math> is a [[Directed Tree#Multi-way Search Trees|multi-way search tree]] with <math>2M-1</math> slots for keys and, conseque ...the definition of [[Directed Tree#Multi-way Search Trees|multi-way search trees]]. In other words, for <math>R</math> the [[Directed Tree#Range|range]] of
  3 KB (541 words) - 13:49, 26 May 2015
• Maximum branching
  A [[Basic graph definitions#Forests, trees, branchings, arborescences|branching]] <math>B=(V,A')</math> of maximum wei
  689 bytes (107 words) - 07:53, 8 November 2015
• Hopcroft-Tarjan
  ...he '''depth''' of <math>v</math> in the [[Basic graph definitions#Forests, trees, branchings, arborescences|arborescence]] created by the DFS procedure. ...the initial [[Depth-first search|DFS]] [[Basic graph definitions#Forests, trees, branchings, arborescences|arborescence]] of step 1) and all of their [[Bas
  6 KB (1,028 words) - 13:31, 3 November 2015
• B-tree: insert
  ## Call [[B-Trees|B-tree: split node into two siblings]] with pointer <math>p'</math> and ind Basically, we have to verify that the [[B-Trees|implementation invariants of the B-tree data structure]] and the above-ment
  7 KB (1,135 words) - 13:47, 3 March 2017
• B-tree: insert and rearrange
  # In the case <math>p.n < 2M</math>, all implementation invariants of B-trees are maintained if the following <math>K'</math> can be inserted at some pos ...ment about the size of <math>N</math> - all implementation invariants of B-trees are again maintained after insertion.
  4 KB (689 words) - 23:19, 19 June 2015
• Repeated depth-first search
  ...n arborescence, the algorithm returns a [[Basic graph definitions#Forests, trees, branchings, arborescences|branching]] that is a [[Basic graph definitions#
  2 KB (294 words) - 07:28, 3 November 2014
• Sorted sequence
  # [[B-Trees]]
  2 KB (270 words) - 13:06, 21 May 2015
• Basic graph definitions
  == Forests, trees, branchings, arborescences == ...uivalent to weak connectedness). Arborescences are also known as '''rooted trees''', and the unique node with indegree zero is the '''root'''.
  15 KB (2,712 words) - 14:47, 16 May 2015
• B-tree: remove
  Basically, we have to verify that the [[B-Trees|implementation invariants of the B-tree data structure]] and the above-ment Analogously to the induction basis, we have to verify that the [[B-Trees|implementation invariants of the B-tree data structure]] and the above-ment
  10 KB (1,690 words) - 13:58, 3 March 2017
• Main Page
  * [[Union-find with disjoint trees: find]]
  4 KB (380 words) - 15:13, 30 November 2020
• B-tree: merge two siblings
  '''Algorithmic problem:''' See [[B-Trees]]
  4 KB (724 words) - 23:19, 19 June 2015
• Directed Tree
  = Multi-way Search Trees =
  7 KB (1,284 words) - 11:29, 26 May 2015
• Hungarian method
  ...ptyset</math> and a dynamically growing [[Basic graph definitions#Forests, trees, branchings, arborescences|arborescence]] <math>(S\dot\cup T,E_A)</math> by
  6 KB (1,033 words) - 17:26, 27 February 2015
• Breadth-first search
  '''Additional output:''' An [[Basic graph definitions#Forests, trees, branchings, arborescences|arborescence]] <math>A=(V',A')</math> rooted at
  7 KB (1,165 words) - 07:50, 26 October 2015
• Classical bipartite cardinality matching
  ...egy]] is to be chosen that generates an [[Basic graph definitions#Forests, trees, branchings, arborescences|arborescence]] rooted at the start node, for exa
  7 KB (1,284 words) - 08:49, 22 February 2015

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)