Algorithmica Algorithmica Springer-Verlag DOI: 10.1007/s00453-001-0109-4 Algorithmica (2002) 33: 183-200 Algorithmica...  Home/Search
Context
Related
| dehne.carleton.ca/www/public...134.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dehne.carleton.ca/www/pub...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we present deterministic parallel algorithms for the coarse-grained multicomputer (CGM) and bulk synchronous parallel (BSP) models for solving the following well-known graph problems: (1) list ranking, (2) Euler tour construction in a tree, (3) computing the connected components and spanning forest, (4) lowest common ancestor preprocessing, (5) tree contraction and expression tree evaluation, (6) computing an ear decomposition or open ear decomposition, and (7) 2-edge connectivity ... (Update)
Similar documents (at the sentence level): More
72.5%: Efficient Parallel Graph Algorithms for.. - Dehne, Ferreira.. (2002) (Correct)
38.4%: Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (Correct)
14.0%: Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (Correct)
Active bibliography (related documents): More All
0.3: A Randomized Parallel Three-Dimensional Convex Hull.. - Dehne, Deng, Dymond, al. (1997) (Correct)
0.3: Using PRAM Algorithms on a Uniform-Memory-Access.. - Bader, Illendula, .. (2001) (Correct)
0.2: A General Purpose Shared-Memory Model For Parallel Computation - Ramachandran (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ springer-verlag-doi,
author = "Algorithmica Algorithmica Springer-Verlag",
title = "DOI: 10.1007/s00453-001-0109-4",
url = "citeseer.ist.psu.edu/760640.html" }
Citations (may not include all citations):735 A Bridging Model for Parallel Computation (context) - Valiant - 1990
234 General Purpose Parallel Architectures (context) - Valiant - 1990
227 Parallel Merge Sort (context) - Cole - 1988
186 Computational Geometry: An Introduction Through Randomized A.. (context) - Mulmuley - 1993
182 A Comparison of Sorting Algorithms for the Connection Machin.. - Blelloch, Leiserson et al. - 1991
178 Algorithmic Aspects of Vertex Elimination on Graphs (context) - Rose, Tarjan et al. - 1976
177 Direct Bulk-Synchronous Parallel Algorithms - Gerbessiotis, Valiant - 1992
141 Synthesis of Parallel Algorithms (context) - Reif - 1993
135 An Introduction to Parallel Algorithms (context) - Jaja - 1992
122 Parallel Tree Contraction and Its Application (context) - Miller, Reif - 1985
109 Scalable Parallel Geometric Algorithms for Coarse Grained Mu.. - Dehne, Fabri et al. - 1993
90 On Rigid Circuit Graphs (context) - Dirac - 1961
77 An Efficient Parallel Biconnectivity Algorithm (context) - Tarjan, Vishkin - 1985
77 Parallel Connectivity Algorithm (context) - Shiloch, Vishkin et al. - 1983
75 Communication Efficient Parallel Sorting - Goodrich - 1996
48 Efficient Parallel Graph Algorithms for Coarse Grained Multi.. - Caceres, Dehne et al. - 1997
47 Scalable and Architecture Independent Parallel Geometric Alg.. - Dehne, Fabri et al. - 1994
47 Part I: The Basic Technique with Applications to Optimal Par.. (context) - Cole, Vishkin et al. - 1988
45 Convex Hull Algorithm for Coarse Grained Multicomputers (context) - Dehne, Deng et al. - 1995
35 Practical Parallel Algorithms for Personalized Communication.. - Bader, Helman et al.
34 Non-Separable and Planar Graphs (context) - Whitney - 1932
34 Efficient Routing and Message Bounds for Optimal Parallel Al.. (context) - Deng, Dymond - 1995
33 A Comparison of Shared and Nonshared Memory Models of Comput.. (context) - Anderson, Snyder - 1993
32 Parallel Open Ear Decomposition with Applications to Graph B.. - Ramachandran
30 Parallel Ear Decomposition Search (context) - Maon, Schieber et al. - 1986
30 Coarse Grained Parallel Algorithms (context) - Dehne, Special - 1999
23 Efficient Parallel Algorithms for Chordal Graphs - Klein - 1989
23 Shared Memory and the Corollary of Modest Potential (context) - Snyder, Architectures - 1986
21 Better Trade-Offs for Parallel List Ranking - Sibeyn - 1997
20 Randomized Parallel List Ranking for Distributed Memory Mult.. - Dehne, Song
18 Efficient Parallel Ear Decomposition with Applications (context) - Miller, Ramachandran - 1986
16 Parallel Algorithms for Image Processing: Practical Algorith.. (context) - Baumker, Dittrich - 1996
15 Convex Hull and Triangulation Algorithms for Coarse-Grained .. (context) - Ferreira, Rau-Chaplin et al. - 1995
13 Parallel Algorithms for Chordal Graphs (context) - Klein
13 BSP Model: Incorporating General Locality and Unbalanced Com.. (context) - Juurlink, Wijshoff et al. - 1996
13 The Queue-Read Queue-Write Asynchronous PRAM Model - Gibson, Matias et al. - 1997
12 List Ranking and List Scan on the Cray C (context) - Reid-Miller - 1994
5 IEEE Symposium on Parallel and Distributed Processing (context) - Deng, Gu et al. - 1994
4 AConvex Hull Algorithm for Coarse Grained Multiprocessors (context) - Deng - 1994
4 ACM Symposium on Parallel Algorithms and Architectures (context) - Li, Sevcik et al. - 1994
Documents on the same site (http://www.dehne.carleton.ca/www/publications/index.htm): More
Parallel CLUSTAL W for PC Clusters - Cheetham, Dehne, Pitre.. (2003) (Correct)
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (Correct)
Determining Maximum k-Width-Connectivity on Meshes - Hambrusch, Dehne (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC