Sciweavers

672 search results - page 8 / 135
» Lower-stretch spanning trees
Sort
View
GRID
2005
Springer
14 years 1 months ago
Collective operations for wide-area message passing systems using adaptive spanning trees
Abstract— We propose a method for wide-area message passing systems to perform collective operations using dynamically created spanning trees. In our proposal, broadcasts and red...
Hideo Saito, Kenjiro Taura, Takashi Chikayama
IEICET
2011
13 years 2 months ago
Minimum Spanning Tree Problem with Label Selection
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
Akio Fujiyoshi, Masakazu Suzuki
GLOBECOM
2009
IEEE
14 years 2 months ago
From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks
—Ethernet is widely used in Local Area Networks (LANs) due to its simplicity and cost effectiveness. Today, a great deal of effort is being devoted to extending Ethernet capabili...
Chen Avin, Ran Giladi, Nissan Lev-Tov, Zvi Lotker
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
13 years 7 months ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...
WDAG
2001
Springer
107views Algorithms» more  WDAG 2001»
13 years 12 months ago
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
Lisa Higham, Zhiying Liang