Si vous la connaissez, vous pouvez l’ajouter en cliquant ici. <span class="searchmatch">B</span>-<span class="searchmatch">tree</span> (Théorie des graphes) Arbre <span class="searchmatch">B</span>. <span class="searchmatch">B</span>-<span class="searchmatch">tree</span> sur l’encyclopédie Wikipédia (en anglais) ...
→ voir <span class="searchmatch">B</span>-<span class="searchmatch">tree</span>. <span class="searchmatch">B</span>+-<span class="searchmatch">tree</span> (Théorie des graphes) Arbre <span class="searchmatch">B</span>+. <span class="searchmatch">B</span>+-<span class="searchmatch">tree</span> sur l’encyclopédie Wikipédia (en anglais) ...
→ voir <span class="searchmatch">B</span>-<span class="searchmatch">tree</span>. <span class="searchmatch">B</span>*-<span class="searchmatch">tree</span> (Théorie des graphes) Arbre <span class="searchmatch">B</span>*. <span class="searchmatch">B</span>*-<span class="searchmatch">tree</span> sur l’encyclopédie Wikipédia (en anglais) ...
(1981) K-dimensional <span class="searchmatch">B</span>-<span class="searchmatch">tree</span> (« arbre <span class="searchmatch">B</span> à k dimensions »). K-D-<span class="searchmatch">B</span>-<span class="searchmatch">tree</span> (Théorie des graphes) Arbre k-d-<span class="searchmatch">B</span>. K-D-<span class="searchmatch">B</span>-<span class="searchmatch">tree</span> sur l’encyclopédie Wikipédia (en anglais) ...
informatique <span class="searchmatch">B</span>-<span class="searchmatch">tree</span> <span class="searchmatch">B</span>*-<span class="searchmatch">tree</span> <span class="searchmatch">B</span>+-<span class="searchmatch">tree</span> binary <span class="searchmatch">tree</span> BK-<span class="searchmatch">tree</span> BSP <span class="searchmatch">tree</span> fat <span class="searchmatch">tree</span> GC-<span class="searchmatch">tree</span> hash <span class="searchmatch">tree</span> hypertree K-D-<span class="searchmatch">B</span>-<span class="searchmatch">tree</span> k-d <span class="searchmatch">tree</span> LSD <span class="searchmatch">tree</span> LSDh-<span class="searchmatch">tree</span> M-<span class="searchmatch">tree</span> Merkle <span class="searchmatch">tree</span> nona-tree...
des clés sans valeur, et dont les feuilles sont reliées entre elles. Anglais : <span class="searchmatch">B</span>+-<span class="searchmatch">tree</span> (en) France (Toulouse) : écouter « arbre <span class="searchmatch">B</span>+ [Prononciation ?] »...
minimum d'éléments dans chaque nœud à 2/3 du maximum, au lieu de 1/2. Anglais : <span class="searchmatch">B</span>*-<span class="searchmatch">tree</span> (en) France (Toulouse) : écouter « arbre <span class="searchmatch">B</span>* [Prononciation ?] »...
vous pouvez l’ajouter en cliquant ici. Arbre à k dimensions. arbre k-d-<span class="searchmatch">B</span> \aʁbʁ ka.de.be\ masculin Arbre k-d d'arbres <span class="searchmatch">B</span>. Anglais : K-D-<span class="searchmatch">B</span>-<span class="searchmatch">tree</span> (en)...
Springer, 28 nov. 2005) <span class="searchmatch">B</span>-arbre arbre <span class="searchmatch">B</span>+ arbre <span class="searchmatch">B</span>* Anglais : <span class="searchmatch">B</span>-<span class="searchmatch">tree</span> (en) Chinois : <span class="searchmatch">B</span>树 (zh) (<span class="searchmatch">B</span>樹) <span class="searchmatch">B</span> shù France (Toulouse) : écouter « arbre <span class="searchmatch">B</span> [Prononciation ?] »...
quin-<span class="searchmatch">tree</span> (Théorie des graphes) Type d'arbre pour index de base de données spatiales. Let us now consider a quin-<span class="searchmatch">tree</span> which is similar to the nona-<span class="searchmatch">tree</span> but...