334 search results - page 29 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
84
Voted
TCAD
2002
14 years 9 months ago
2002
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
APPINF
2003
14 years 11 months ago
2003
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
EOR
2006
14 years 9 months ago
2006
We propose the use of scatter search with path relinking for the inference of phylogenetic trees. Solutions are here represented as trees whose leaves span the set of species unde...
PDCAT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...
PDCAT
2004
Springer
15 years 3 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...