58 search results - page 1 / 12 » Collective Tree Spanners in Graphs with Bounded Parameters |
ALGORITHMICA
2010
13 years 5 months ago
2010
WG
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
WG
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v w...
ALGORITHMICA
2002
13 years 4 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...