355 search results - page 30 / 71 » On Central Spanning Trees of a Graph |
212
click to vote
ALGOSENSORS
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
167
click to vote
ICALP
2007
Springer
16 years 7 days ago
2007
Springer
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
176
Voted
IJCM
2002
15 years 5 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...
173
click to vote
AINA
2007
IEEE
16 years 13 days ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
173
click to vote
LATIN
2010
Springer
16 years 27 days 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...