Search results

A '''Jech–Kunen tree''' is a [[Tree (set theory)|set-theoretic tree]] with properties that are incompatible with the [[generaliz A ''ω''₁-tree is a [[Tree (set theory)|tree]] with [[cardinality]] <math>\aleph_1</math> and height ''ω''<sub>1</ ...

...math>n</math> leaves. The leaves of these trees are given labels from some set <math>L</math> with <math>|L|=n</math> so that no pair of leaves in the sam ....|date=1997-12-01|title=Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms|journal=SIAM Journal on Computing|volume= ...

...describes some properties of objects such as [[Tree (graph theory)|rooted trees]] and [[vector field]]s on [[affine space]]. ...as been introduced by [[Murray Gerstenhaber]] in his work on [[Deformation theory|deformations]] of algebras. ...

...rem is closely related to [[Kirchhoff's theorem]] on counting the spanning trees of a graph, from which it can be derived.{{r|williams}} It was first stated A finite Markov chain consists of a finite set of states, and a transition probability <math>p_{i,j}</math> for changing f ...

...particular, it bears the [[quotient topology]] of the [[Set (mathematics)|set]] == Subgraphs and trees == ...

{{Short description|Trees with additional directed half edges}} ...print= 1305.1312v3|title= Generic method for bijections between blossoming trees and planar maps|date=2015|class= math.CO}}</ref> ...

{{Short description|Method used in automata theory to represent tree structures using arithmetical sequences}} ...a theory, a '''tree''' is a particular way of representing a [[Tree (graph theory)|tree structure]] as sequences of natural numbers. ...

...allel computation]] of solutions to common problems in [[algorithmic graph theory]]. It was introduced by Tarjan and Vishkin in 1984.<ref name="Tarjan">{{Cit Given an undirected tree presented as a set of edges, the Euler tour representation (ETR) can be constructed in paralle ...

...es or as an extension of [[ω-automata|infinite-word automata]] to infinite trees. ...matics) | S2S]], the [[monadic second-order logic | monadic second-order]] theory with two successors. It has been further observed that tree automata and lo ...

...estion. It is a method to compute [[Partition of a set|partitions]] of the set of vertices and detect zones of high concentration of edges, and is analogo ...a set|partitions]] of <math>V</math>, and <math>\partial \pi</math> be the set of edges crossing over the sets of the partition <math>\pi\in\Pi</math>, th ...

...ind of [[geometric spanner]], a weighted [[undirected graph]] connecting a set of [[point (geometry)|geometric points]] with the property that, for every .... C.|last=Yao|authorlink=Andrew Yao|title=On constructing minimum spanning trees in ''k''-dimensional space and related problems|journal=[[SIAM Journal on C ...

...rtain user-specified level, where "support" is calculated as the number of trees in a database which have at least one subtree [[Graph isomorphism|isomorphi ...ding all trees <math>\mathcal{P}\subset\mathcal{C}</math> such that no two trees in <math>\mathcal{P}</math> are isomorphic and ...

{{harvtxt|Hu|1974}} writes that the problem of constructing these trees was proposed by Francesco Maffioli.{{r|hu}} ...t on the number of vertices of the input graph, and by searching among all trees with <math>k</math> internal nodes.{{r|wlbcrt}} ...

...esigning highly-parallelized algorithms for various balanced binary search trees. The algorithmic framework is based on a single operation ''join''.<ref nam ...r, if the trees are [[search tree]]s, which means that the in-order of the trees maintain a [[total ordering]] on keys, it must satisfy the condition that a ...

...the information theoretic barrier with fusion trees|journal=[[Symposium on Theory of Computing]]|pages=1–7|date=1990}}</ref> ...[logical shift]]s to be done in [[constant time]] (the precise instruction set assumed by an algorithm or proof using the model may vary). ...

...a)</math>, where <math>H_0(s)</math> is the order-0 [[Entropy (information theory)|empirical entropy]] of <math>s</math>. ...tree contains a bitmap representation of a string. If we know the alphabet set, then the exact string can be inferred by tracking bits down the tree. To f ...

...ry tree''' is an [[free tree|unrooted tree]] in which each [[vertex (graph theory)|vertex]] has either one or three neighbors. ...ining vertices are the ''internal nodes'' of the tree. The [[degree (graph theory)|degree]] of a vertex is its number of neighbors; in a tree with more than ...

...-like mathematical objects that capture the "meaning" of a term up to some set of "meaningless" terms. Böhm trees may also be applied in the context of the infinitary lambda calculus, which ...

...st2=Foulds|first2=L.R.|date=February 1981|title=Comparison of phylogenetic trees|url=https://linkinghub.elsevier.com/retrieve/pii/0025556481900432|journal=M ...esent a relatively intuitive measure of the distances between phylogenetic trees and therefore remain widely used (the original 1981 paper describing Robins ...

...the '''Gyárfás–Sumner conjecture''' asks whether, for every [[Tree (graph theory)|tree]] <math>T</math> and [[complete graph]] <math>K</math>, the graphs wi ...e chromatic number and, at the same time, arbitrarily large [[girth (graph theory)|girth]].{{r|eh66}} Using these graphs, one can obtain graphs that avoid an ...