672 search results - page 52 / 135 » Lower-stretch spanning trees |
77
Voted
WG
2004
Springer
15 years 5 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...
104
click to vote
IJCM
2002
14 years 11 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
110
click to vote
CORIA
2007
15 years 1 months ago
2007
In this paper, we propose a fuzzy model to querying the XML documents, by taking into account not only the document contents, but also their structure. The concept of minimal size ...
104
click to vote
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
75
Voted
SWAT
2004
Springer
15 years 5 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...