20 search results - page 1 / 4 » On Identifying Strongly Connected Components in Parallel |
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
IICS
2005
Springer
13 years 10 months ago
2005
Springer
We provide an approach to distribute the calculation of PageRank, by splitting the graph into its strongly connected components. As we prove, the global ranking may be calculated c...
PPOPP
2012
ACM
12 years 22 days ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
HT
1991
ACM
13 years 8 months ago
1991
ACM
Hypertext systems are being used in many applications because of their flexible structure and the great browsing freedom they give to diverse communities of users. However, this s...
ICDCS
1997
IEEE
13 years 9 months ago
1997
IEEE
—The increasing deployment of wireless access technology, along with the emergence of high speed integrated service networks, such as ATM, promises to provide mobile users with u...