178 search results - page 8 / 36 » Constructing the Spanners of Graphs in Parallel |
SIAMCOMP
2000
13 years 7 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
ICDCS
1996
IEEE
13 years 11 months ago
1996
IEEE
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a h...
SPAA
1993
ACM
13 years 11 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...
BMCBI
2010
13 years 7 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...