Sciweavers

1545 search results - page 79 / 309
» On tree congestion of graphs
Sort
View
BIRTHDAY
2009
Springer
15 years 4 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
CDC
2008
IEEE
105views Control Systems» more  CDC 2008»
15 years 4 months ago
On the stability of distance-based formation control
— This paper examines stability properties of distance-based formations. These are formations encoded by inter-agent relative distances. A negative gradient control law is propos...
Dimos V. Dimarogonas, Karl Henrik Johansson
IFIP
2004
Springer
15 years 3 months ago
Engineering an External Memory Minimum Spanning Tree Algorithm
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
Roman Dementiev, Peter Sanders, Dominik Schultes, ...
ESA
2000
Springer
110views Algorithms» more  ESA 2000»
15 years 1 months ago
Maintaining a Minimum Spanning Tree Under Transient Node Failures
Given a 2-node connected, undirected graph G = (V, E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem o...
Enrico Nardelli, Guido Proietti, Peter Widmayer
DAM
2008
78views more  DAM 2008»
14 years 10 months ago
Semi-preemptive routing on trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
Sven Oliver Krumke, Dirk Räbiger, Rainer Schr...