214 search results - page 22 / 43 » A linear time algorithm for L(2,1)-labeling of trees |
90
Voted
GD
2004
Springer
15 years 3 months ago
2004
Springer
This paper discusses a new method for visualisation of large and complex networks in three dimensions. In particular, we focus on visualising the core tree structure of the large a...
DAC
1989
ACM
15 years 2 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
76
Voted
ISAAC
2007
Springer
15 years 4 months ago
2007
Springer
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...
AAAI
1996
14 years 11 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
162
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...