Sciweavers

Share
5 search results - page 1 / 1
» Broadcasting in (n, k)-Arrangement Graph Based on an Optimal...
Sort
View
ASIAMS
2007
IEEE
10 years 9 months ago
Broadcasting in (n, k)-Arrangement Graph Based on an Optimal Spanning Tree
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...
Jingli Li, Yonghong Xiang, Manli Chen, Yongheng Zh...
PDCAT
2004
Springer
10 years 8 months ago
An Optimal Broadcasting Algorithm for de Bruijn Network dBG(d, k)
Recent works have classi´Čüed de Bruijn graph (dBG) based broadcasting algorithms into local broadcasting and arc-disjoint spanning trees based broadcasting. However, those algorit...
Ngoc Chi Nguyen, Sungyoung Lee
COR
2008
142views more  COR 2008»
10 years 2 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
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...
Luis Gouveia, Ana Paias, Dushyant Sharma
ALGOSENSORS
2009
Springer
10 years 15 days ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
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...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
10 years 6 months ago
Geometric lower bounds for parametric matroid optimization
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...
David Eppstein
books