209 search results - page 19 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
ESA
1998
Springer
15 years 1 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
EOR
2006
14 years 9 months ago
2006
We propose the use of scatter search with path relinking for the inference of phylogenetic trees. Solutions are here represented as trees whose leaves span the set of species unde...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
112
click to vote
PODS
1994
ACM
15 years 1 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
AINA
2008
IEEE
14 years 11 months ago
2008
IEEE
It is important to design an energy efficient data gathering tree structure for wireless sensor networks. As for the energy efficiency, network's overall energy consumption an...