- topological tree
- мат. топологическое дерево
Большой англо-русский и русско-английский словарь. 2001.
topological tree
Смотреть что такое "topological tree" в других словарях:
Topological sorting — Dependency resolution redirects here. For other uses, see Dependency (disambiguation). In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that, for every edge uv, u comes… … Wikipedia
Topological graph theory — In mathematics topological graph theory is a branch of graph theory. It studies the embedding of graphs in surfaces, and graphs as topological spaces. [J.L. Gross and T.W. Tucker, Topological graph theory, Wiley Interscience, 1987] Embedding a… … Wikipedia
Topological combinatorics — The discipline of combinatorial topology used combinatorial concepts in topology and in the early 20th century this gradually turned into the field of algebraic topology. In 1978 the situation was reversed when methods from algebraic topology… … Wikipedia
Real tree — A real tree, or an mathbb R tree, is a metric space ( M , d ) such thatfor any x , y in M there is a unique arc from x to y and this arc is a geodesic segment. Here by an arc from x to y we mean the image in M of a topological embedding f from an … Wikipedia
Decision tree — This article is about decision trees in decision analysis. For the use of the term in machine learning, see Decision tree learning. A decision tree is a decision support tool that uses a tree like graph or model of decisions and their possible… … Wikipedia
Uniform tree — In mathematics, a uniform tree is a locally finite tree which is the universal cover of a finite graph. Equivalently, the full automorphism group G=Aut(X) of the tree, which is a locally compact topological group, is unimodular and GX is finite.… … Wikipedia
Functional design — is a paradigm used to simplify the design of computer software and increasingly, 3D modeling. A functional design assures that each modular part of a computer program has only one responsibility and performs that responsibility with the minimum… … Wikipedia
Filled Julia set — The filled in Julia set K(f c) of a polynomial f c is defined as the set of all points z, of dynamical plane that have bounded orbit with respect to f c K(f c) overset{underset{mathrm{def{{=} { z in mathbb{C} : f^{(k)} c (z) ot o infty as k o… … Wikipedia
List of mathematics articles (T) — NOTOC T T duality T group T group (mathematics) T integration T norm T norm fuzzy logics T schema T square (fractal) T symmetry T table T theory T.C. Mits T1 space Table of bases Table of Clebsch Gordan coefficients Table of divisors Table of Lie … Wikipedia
Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i … Wikipedia
Operad theory — is a field of abstract algebra concerned with prototypical algebras that model properties such as commutativity or anticommutativity as well as various amounts of associativity. Operads generalize the various associativity properties already… … Wikipedia
