2354 search results - page 109 / 471 » Radio number for trees |
150
click to vote
NGC
2001
Springer
15 years 10 months ago
2001
Springer
IP multicast suffers from scalability problems for large numbers of multicast groups, since each router keeps forwarding state proportional to the number of multicast tree passing ...
180
click to vote
GD
1998
Springer
15 years 10 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
161
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
162
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
197
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...