11 search results - page 1 / 3 » Parallel morphing of trees and cycles |
CCCG
2003
13 years 6 months ago
2003
We prove that for any two simple chains [more generally, trees] in Rd with corresponding edges parallel, there is a parallel morph between them—i.e. a morph in which all interme...
SPAA
1993
ACM
13 years 9 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
EUROPAR
2005
Springer
13 years 11 months ago
2005
Springer
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tr...
TWC
2008
13 years 5 months ago
2008
In this paper, we investigate the application of nonbinary low-density parity-check (LDPC) cycle codes over Galois field GF(q) to multiple-input multiple-output (MIMO) channels. Tw...
PDCAT
2007
Springer
13 years 11 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...