213 search results - page 21 / 43 » Maintaining Minimum Spanning Trees in Dynamic Graphs |
150
click to vote
STACS
2007
Springer
15 years 10 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 ...
157
click to vote
SAC
2009
ACM
15 years 8 months ago
2009
ACM
During a disaster, emergency response operations can benefit from the establishment of a wireless ad hoc network. We propose the use of autonomous robots that move inside a disas...
134
click to vote
ESA
1994
Springer
15 years 8 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
167
click to vote
AINA
2005
IEEE
15 years 9 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
142
click to vote
DAM
1999
15 years 3 months 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...