241 search results - page 34 / 49 » Degree Bounded Spanning Trees |
IPPS
2008
IEEE
14 years 1 months ago
2008
IEEE
We present a novel protocol for restructuring a treebased overlay network in response to the workload of the application running over it. Through low-cost restructuring operations...
SPAA
2010
ACM
14 years 6 days ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
SOFSEM
1997
Springer
13 years 11 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...