2354 search results - page 157 / 471 » Radio number for trees |
196
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
200
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
168
click to vote
ICDCN
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
159
click to vote
INFOCOM
2008
IEEE
16 years 27 days ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
166
click to vote
ISM
2008
IEEE
16 years 27 days ago
2008
IEEE
We present a set of techniques to simplify tree models for faster rendering while retaining their visual resemblance to the original model. This goal is achieved by setting a budg...