2354 search results - page 124 / 471 » Radio number for trees |
161
click to vote
CCCG
2003
15 years 7 months ago
2003
We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for su...
174
click to vote
IADIS
2003
15 years 7 months ago
2003
In this short paper, we propose a new key management architecture for Multicast communications. This architecture combines the complementary variable approach with hashed keys and...
180
click to vote
DAM
2007
15 years 6 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
164
click to vote
GLOBECOM
2007
IEEE
16 years 22 days ago
2007
IEEE
— A large number of overlay protocols have been developed, almost all of which assume each host has two-way communication capability. However, this does not hold as the deploymen...
154
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...