to k-d trees. In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional...

In graph theory, a k-tree is an undirected graph formed by starting with a (k + 1)-vertex complete graph and then repeatedly adding vertices in such a...

graph theory, a partial k-tree is a type of graph, defined either as a subgraph of a k-tree or as a graph with treewidth at most k. Many NP-hard combinatorial...

relaxed K-d tree or relaxed K-dimensional tree is a data structure which is a variant of K-d trees. Like K-dimensional trees, a relaxed K-dimensional tree stores...

The k-minimum spanning tree problem, studied in theoretical computer science, asks for a tree of minimum cost that has exactly k vertices and forms a subgraph...

an m-ary tree (for nonnegative integers m) (also known as n-ary, k-ary or k-way tree) is an arborescence (or, for some authors, an ordered tree) in which...

science, a K-D-B-tree (k-dimensional B-tree) is a tree data structure for subdividing a k-dimensional search space. The aim of the K-D-B-tree is to provide...

In combinatorial mathematics, the Steiner tree problem, or minimum Steiner tree problem, named after Jakob Steiner, is an umbrella term for a class of...

A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all...

Left-leaning red–black tree AVL tree B-tree (2–3 tree, 2–3–4 tree, B+ tree, B*-tree, UB-tree) Scapegoat tree Splay tree T-tree WAVL tree Cormen, Thomas H.;...

An adaptive k-d tree is a tree for multidimensional points where successive levels may be split along different dimensions. Samet, Hanan (2006). Foundations...

most a given variable k. However, when k is any fixed constant, the graphs with treewidth k can be recognized, and a width k tree decomposition constructed...

A k-ary tree (for nonnegative integers k) is a rooted tree in which each vertex has at most k children. 2-ary trees are often called binary trees, while...

botany, a tree is a perennial plant with an elongated stem, or trunk, usually supporting branches and leaves. In some usages, the definition of a tree may be...

binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child. That is, it is a k-ary...

query point in time O(log n + k), k being the number of retrieved intervals or segments. Applications of the segment tree are in the areas of computational...

graphs with treewidth exactly k are called k-trees, and the graphs with treewidth at most k are called partial k-trees. Many other well-studied graph...

Then, BK-tree is defined in the following way. An arbitrary element a is selected as root node. The root node may have zero or more subtrees. The k-th subtree...

cardinal tree (or trie) of degree k, by analogy with cardinal numbers and by opposition with ordinal trees, is a rooted tree in which each node has k positions...

A B+ tree is an m-ary tree with a variable but often large number of children per node. A B+ tree consists of a root, internal nodes and leaves. The root...

An implicit k-d tree is a k-d tree defined implicitly above a rectilinear grid. Its split planes' positions and orientations are not given explicitly but...

dollar stores was continued alongside K&K Toys stores, mostly in enclosed malls. On April 27, 1989, the first “Dollar Tree”-branded store opened at the Jessamine...

In mathematics, Kruskal's tree theorem states that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under homeomorphic...

variable definitions: K: Maximum number of potential search keys for each node in a B-tree. (this value is constant over the entire tree). p t i {\displaystyle...

In computer science, tree traversal (also known as tree search and walking the tree) is a form of graph traversal and refers to the process of visiting...

of decision trees (also called k-DT), an early method that used randomized decision tree algorithms to generate multiple different trees from the training...

Moringa oleifera is a fast-growing, drought-resistant tree of the family Moringaceae, native to the Indian subcontinent and used extensively in South and...

is also a term that is always pronounced and occasionally transcribed as K-Hive, and refers to the wider online community that is not formally affiliated...

number of spanning trees is t ( G ) = 2 2 n − n − 1 ∏ k = 2 n k ( n k ) {\displaystyle t(G)=2^{2^{n}-n-1}\prod _{k=2}^{n}k^{n \choose k}} . More generally...

Complete coloring, a.k.a. achromatic number: GT5  Cycle rank Degree-constrained spanning tree: ND1  Domatic number: GT3  Dominating set, a.k.a. domination number: GT2 ...