Search results

In [[topology]], a branch of [[mathematics]], a '''graph''' is a [[topological space]] wh Thus, in particular, it bears the [[quotient topology]] of the [[Set (mathematics)|set]] ...

.../2 [[Node (networking)|nodes]]. It can be noted that the entire [[network topology]] is almost regular with an O(log n) diameter. ...th a complete [[binary tree]]s of height one and the roots of these binary trees are connected with [[Shuffle-exchange network|Shuffle-Exchange]] fashion. ...

...equivalent to the existence of a compact [[Hausdorff space]] with [[Base (topology)#Definition and basic properties|weight]] <math>\aleph_1</math> and cardina ...tion|mr=0284331 |last=Jech|first= Thomas J.|authorlink=Thomas Jech|title= Trees|journal= [[Journal of Symbolic Logic]]|volume= 36 |year=1971|pages= 1–14|do ...

...bsets of four leaves that are not related by the same [[topology]] in both trees. ...th>O(N^4)</math> time, where <math>N</math> is the number of leaves in the trees. ...

...ematics)|action]] of [[group (mathematics)|groups]] on [[Real tree|'''R'''-trees]]. It was introduced in unpublished work of [[Eliyahu Rips]] in about 1991 ...aden | last2=Feighn | first2=Mark | title=Stable actions of groups on real trees | doi=10.1007/BF01884300 | doi-access=free | mr=1346208 | year=1995 | journ ...

..., particularly [[topology]], a '''comb space''' is a particular [[subspace topology|subspace]] of <math>\R^2</math> that resembles a [[comb]]. The comb space h Consider <math>\R^2</math> with its [[standard topology]] and let ''K'' be the [[Set (mathematics)|set]] <math>\{1/n ~|~ n \in \mat ...

{{Short description|Hybrid network topology}}{{Distinguish|Tree (data structure)}} [[File:TreeTopology.png|alt= Tree topology|thumb|Tree network topology]] ...

...e-Carlo]] variants (see [[Rapidly exploring random tree]]). Space-filling trees have interesting parallels in nature, including [[fluid distribution system ...defined by an iterative process whereby a single point in a [[continuity (topology)|continuous]] space is connected via a continuous path to every other point ...

...logy for parallel computers with <math>2^d</math> processing elements. The topology allows for an efficient implementation of some basic communication primitiv ...m to the roots of the binomial trees. Upon receiving a chunk, the binomial trees broadcast it. ...

...ry''' of [[Teichmüller space]] of a surface is obtained as the [[Boundary (topology)|boundary]] of its closure in the projective space of functionals on simple ...Teichmüller space a topology (the right-hand side being given the product topology). ...

...omputational topology]]'', which studies the application of computation to topology. ==Topology of lambda calculus== ...

...|url=https://msp.org/agt/2009/9-3/p08.xhtml |journal=Algebraic & Geometric Topology |volume=9 |issue=3 |pages=1423–1466 |doi=10.2140/agt.2009.9.1423 |issn=1472 === The space of marked groups and the Chabauty topology === ...

...t of infinite subsets of <math>\omega</math>, is given the usual [[product topology]].<ref name="Simpson85"/> ...</math>'' be a quasi-ordering and endow <math>Q</math> with the [[discrete topology]]. A ''<math>Q</math>-array'' is a Borel function <math>[A]^{\omega}\to Q</ ...

She is also known for her research on [[Shelling (topology)|shellings]] for [[simplicial complex]]es,{{ran|F}} [[partially ordered set | title = A new algorithm for minimum cost binary trees ...

...ve-url=https://web.archive.org/web/20200223170824/http://www.kovalevsky.de/Topology/Introduction_e.htm#a6 |access-date=November 30, 2021|archive-date=2020-02-2 [[File:SimpleGraf.jpg|thumb|All [[Graph (topology)|graphs]] are ([[Homeomorphism|homeomorphic]] to) 1-dimensional cubical com ...

...create a formal probabilistic model. When there is sufficient data, staged trees can instead be used as a [[Machine learning|machine learning]] tool to find ...ombinations of these variables have non-zero probability. Non-x-compatible trees instead allow structural zeros - when certain combinations of the variables ...

...=Munch |first1=Elizabeth |title=The ℓ ∞-Cophenetic Metric for Phylogenetic Trees As an Interleaving Distance |date=2019 |url=http://link.springer.com/10.100 [[Category:Computational topology]] ...

...last3=Kaski | first3=K. | last4=Kertész | first4=J. | title=Dynamic asset trees and Black Monday | journal=Physica A: Statistical Mechanics and Its Applica ...

{{Short description|Generalization of depth-first search trees}} .../math> is a type of [[spanning tree]], generalizing [[depth-first search]] trees. ...

...ture]] based on a binary tree for unrooted dynamic [[Tree (data structure)|trees]] that is used mainly for various path-related operations. It allows simple ''Top trees'' are used for maintaining a Dynamic forest (set of trees) under [[#Dynamic Operations|link and cut operations.]] ...