Sciweavers

241 search results - page 18 / 49
» Degree Bounded Spanning Trees
Sort
View
WWIC
2007
Springer
182views Communications» more  WWIC 2007»
14 years 2 months ago
Multicast Overlay Spanning Tree Protocol for Ad Hoc Networks
In this paper we present an extension to the OLSR unicast routing protocol to support multicast routing in mobile ad hoc networks. The proposed protocol is based on Multicast Overl...
Georgios Rodolakis, Amina Meraihi Naimi, Anis Laou...
SOFSEM
2007
Springer
14 years 2 months ago
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Ku...
FOCS
1998
IEEE
14 years 22 days ago
Parametric and Kinetic Minimum Spanning Trees
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
Pankaj K. Agarwal, David Eppstein, Leonidas J. Gui...
IPPS
2005
IEEE
14 years 2 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
BIRTHDAY
2009
Springer
14 years 3 months ago
The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension
We introduce the weak gap property for directed graphs whose vertex set S is a metric space of size n. We prove that, if the doubling dimension of S is a constant, any directed gra...
Michiel H. M. Smid