230 search results - page 22 / 46 » A Linear Time Algorithm for L(2, 1)-Labeling of Trees |
WADS
1997
Springer
14 years 1 months ago
1997
Springer
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
CAD
2008
Springer
13 years 9 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
SODA
2000
ACM
13 years 10 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
TAMC
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...