منابع مشابه
Amenability of horospheric products of uniformly growing trees
The horospheric product of two uniformly growing trees is amenable if and only if their growth rates match.
متن کاملSteiner trees in uniformly quasi-bipartite graphs
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation algorithm has a performance ratio of 1.550. This is still far away from 1.0074, the largest known lower bound on the achievable performance ratio. As all instances resulting from known lower bound reductions are uniformly quasi-bipartite,...
متن کاملGrowing Decision Trees Less Greedily
Most algorithms which induce model structure from sample data proceed, to varying degrees, "greedily". That is, they sequentially add to the current model the candidate component which works best with the existing structure. (Such components include a linear term with stepwise regression, a small polynomial with GMDH-like methods2, or a threshold split with decision trees.) This greedy search p...
متن کاملMemory effect in growing trees
We show that the structure of a growing tree preserves an information on the shape of an initial graph. For the exponential trees, evidence of this kind of memory is provided by means of the iterative equations, derived for the moments of the nodenode distance distribution. Numerical calculations confirm the result and allow to extend the conclusion to the Barabási–Albert scale-free trees. The ...
متن کاملFixed Points of Uniformly Lipschitzian Mappings in Metric Trees
In this paper we examine the basic structure of metric trees and prove fixed point theorems for uniformly Lipschitzian mappings in metric trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1995
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1995290100451