79 search results - page 9 / 16 » Fast Self-Stabilizing Minimum Spanning Tree Construction |
111
Voted
WINET
2010
14 years 11 months ago
2010
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
95
Voted
ICIP
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...
121
Voted
STACS
2007
Springer
15 years 7 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 ...
116
click to vote
DAM
1999
15 years 13 days ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
112
click to vote
ISPD
2005
ACM
15 years 6 months ago
2005
ACM
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...