214 search results - page 17 / 43 » A linear time algorithm for L(2,1)-labeling of trees |
CCCG
1998
14 years 11 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
95
Voted
CPM
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Phylogenetics is a science of determining connections between groups of organisms in terms of ancestor/descendent relationships, usually expressed by phylogenetic trees, ...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
CPM
2007
Springer
15 years 2 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...