5 search results - page 1 / 1 » Broadcasting in (n, k)-Arrangement Graph Based on an Optimal... |
ASIAMS
2007
IEEE
13 years 10 months ago
2007
IEEE
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...
PDCAT
2004
Springer
13 years 9 months ago
2004
Springer
Recent works have classified de Bruijn graph (dBG) based broadcasting algorithms into local broadcasting and arc-disjoint spanning trees based broadcasting. However, those algorit...
COR
2008
13 years 3 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
ALGOSENSORS
2009
Springer
13 years 2 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...
STOC
1995
ACM
13 years 7 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...