IJCM
2002
13 years 4 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
JCB
2000
13 years 4 months ago
2000
It has been postulated that existing species have been linked in the past in a way that can be described using an additive tree structure. Any such tree structure reflecting speci...
ENTCS
2002
13 years 4 months ago
2002
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the tree...
IJCSS
2000
13 years 4 months ago
2000
Abstract. The quality of a decision tree is usually evaluated through its complexity and its generalization accuracy. Tree-simpli
DM
2002
13 years 4 months ago
2002
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...
CGF
2004
13 years 4 months ago
2004
A method is proposed for photo-realistic modeling and visualization of a growing tree. Recent visualization methods have focused on producing smoothly blending branching structure...
CCR
2004
13 years 4 months ago
2004
Peer-to-peer (P2P) networks represent an effective way to share information, since there are no central points of failure or bottleneck. However, the flip side to the distributive...
JUCS
2007
13 years 4 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
JOIN
2007
13 years 4 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
TOG
2008
13 years 4 months ago
2008
In this paper, we introduce a simple sketching method to generate a realistic 3D tree model from a single image. The user draws at least two strokes in the tree image: the first c...