|
Results
Found 37 publication records. Showing 37 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 3 | Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean |
Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing. (PDF / PS)  |
IPPS  |
1995 |
DBLP DOI BibTeX RDF |
massively parallel SIMD computer, virtual processing, parallel algorithms, graph theory, virtual machines, graph algorithms, parallel graph algorithms, MasPar MP-1 |
| 2 | Albert Chan, Chunmei Gao, Andrew Rau-Chaplin |
A Coarse Grained Parallel Algorithm for Closest Larger Ancestors in Trees with Applications to Single Link Clustering.  |
HPCC  |
2005 |
DBLP DOI BibTeX RDF |
Single Link Clustering, Closest Larger Ancestor, Hierarchical Agglomerative Clustering, Parallel Graph Algorithms, Coarse Grained Multicomputer |
| 2 | David A. Bader, Sukanya Sreshta, Nina R. Weisse-Bernstein |
Evaluating Arithmetic Expressions Using Tree Contraction: A Fast and Scalable Parallel Implementation for Symmetric Multiprocessors (SMPs) (Extended Abstract).  |
HiPC  |
2002 |
DBLP DOI BibTeX RDF |
High-Performance Algorithm Engineering, Shared Memory, Parallel Graph Algorithms, Expression Evaluation, Tree Contraction |
| 2 | Donald S. Fussell, Ramakrishna Thurimella |
Successive Approximation in Parallel Graph Algorithms.  |
STACS  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Guojing Cong, Konstantin Makarychev |
Optimizing Large-Scale Graph Analysis on a Multi-threaded, Multi-core Platform.  |
IPDPS  |
2011 |
DBLP DOI BibTeX RDF |
Multi-threading, Parallel Graph Algorithms |
| 1 | Frank Dehne, Kumanan Yogaratnam |
Exploring the Limits of GPUs With Parallel Graph Algorithms  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | David A. Bader |
Petascale Computing for Large-Scale Graph Problems.  |
CISIS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mike Heroux, Zhaofang Wen, Junfeng Wu, Yuesheng Xu |
Initial Experiences with the BEC Parallel Programming Environment.  |
ISPDC  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Guojing Cong, David A. Bader |
Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors.  |
ISPA  |
2007 |
DBLP DOI BibTeX RDF |
Shared Memory, Spanning Tree, Minimum Spanning Tree, Biconnected Components |
| 1 | Andreas Beckmann, Jorg Keller |
Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions.  |
PDP  |
2007 |
DBLP DOI BibTeX RDF |
parallel storage systems, cryptography, parallel graph algorithms |
| 1 | David A. Bader |
Petascale Computing for Large-Scale Graph Problems.  |
PPAM  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Bader, Kamesh Madduri |
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2.  |
ICPP  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Guojing Cong, Simone Sbaraglia |
A Study on the Locality Behavior of Minimum Spanning Tree Algorithms.  |
HiPC  |
2006 |
DBLP DOI BibTeX RDF |
memory locality, graph algorithm, minimum spanning tree |
| 1 | Douglas Gregor, Andrew Lumsdaine |
Lifting sequential graph algorithms for distributed-memory parallel computation.  |
OOPSLA  |
2005 |
DBLP DOI BibTeX RDF |
distributed computing, generic programming, parallel graph algorithms |
| 1 | David A. Bader, Guojing Cong, John Feo |
On the Architectural Requirements for Efficient Execution of Graph Algorithms.  |
ICPP  |
2005 |
DBLP DOI BibTeX RDF |
Shared Memory, Multithreading, Graph Algorithms, Connected Components, List ranking |
| 1 | Guojing Cong, David A. Bader |
The Euler Tour Technique and Parallel Rooted Spanning Tree.  |
ICPP  |
2004 |
DBLP DOI BibTeX RDF |
High-Performance Algorithm Engineering, Shared Memory, Spanning Tree, Parallel Graph Algorithms, Euler Tour |
| 1 | David A. Bader, Guojing Cong |
A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors.  |
IPDPS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. H. A. Dehne, Afonso Ferreira, Edson Cáceres, Siang W. Song, Alessandro Roncato |
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP.  |
Algorithmica  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark F. Adams |
A distributed memory unstructured gauss-seidel algorithm for multigrid smoothers.  |
SC  |
2001 |
DBLP DOI BibTeX RDF |
parallel gauss-seidel, unstructured multigrid, algebraic multigrid, parallel graph algorithms |
| 1 | Edson Cáceres, Frank K. H. A. Dehne, Afonso Ferreira, Paola Flocchini, Ingo Rieping, Alessandro Roncato, Nicola Santoro, Siang W. Song |
Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP.  |
ICALP  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis Ibarra, Dana S. Richards |
Tree Open Ear Decomposition in Parallel Graph Algorithms.  |
Parallel Processing Letters  |
1995 |
DBLP BibTeX RDF |
|
| 1 | Jesper Larsson Träff |
Distributed and parallel graph algorithms - models and experiments.  |
|
1995 |
RDF |
|
| 1 | Louis Ibarra, Dana S. Richards |
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition.  |
Parallel Computing  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis Ibarra, Dana S. Richards |
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition.  |
MFCS  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Ouri Wolfson, Weining Zhang, Harish Butani, Akira Kawaguchi, Kui W. Mok |
A Methodology for Evaluating Parallel Graph Algorithms and Its Application to Single Source Reachability.  |
PDIS  |
1993 |
DBLP BibTeX RDF |
|
| 1 | Richard Cole, Uzi Vishkin |
Approximate Parallel Scheduling. II. Applications to Logarithmic-Time Optimal Parallel Graph Algorithms  |
Inf. Comput.  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas H. Spencer |
Time-Work Tradeoffs for Parallel Graph Algorithms.  |
SODA  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas H. Spencer |
More Time-Work Tradeoffs for Parallel Graph Algorithms.  |
SPAA  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Donald S. Fussell, Ramakrishna Thurimella |
Successive Approximation in Parallel Graph Algorithms.  |
Theor. Comput. Sci.  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Sajal K. Das, Narsingh Deo, Sushil K. Prasad |
Parallel graph algorithms for hypercube computers.  |
Parallel Computing  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Chang-Biau Yang, Richard C. T. Lee, Wen-Tsuen Chen |
Parallel Graph Algorithms Based Upon Broadcast Communications.  |
IEEE Trans. Computers  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Don Coppersmith, Prabhakar Raghavan, Martin Tompa |
Parallel Graph Algorithms That Are Efficient on Average  |
Inf. Comput.  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Ingo Schiermeyer |
A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a Graph.  |
WG  |
1989 |
DBLP DOI BibTeX RDF |
sequential and parallel graph algorithms, polylog parallel algorithm, computational complexity, random graphs, graph properties, hamiltonian graphs |
| 1 | Don Coppersmith, Prabhakar Raghavan, Martin Tompa |
Parallel Graph Algorithms that Are Efficient on Average  |
FOCS  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles E. Leiserson, Bruce M. Maggs |
Communication-Efficient Parallel Graph Algorithms.  |
ICPP  |
1986 |
DBLP BibTeX RDF |
|
| 1 | Yung H. Tsin |
Finding Lowest Common Ancestors in Parallel.  |
IEEE Trans. Computers  |
1986 |
DBLP DOI BibTeX RDF |
SIMD models, fundamental cycles, parallel computation, PRAM, Design and analysis of algorithms, parallel graph algorithms, lowest common ancestors |
| 1 | Michael J. Quinn, Narsingh Deo |
Parallel Graph Algorithms.  |
ACM Comput. Surv.  |
1984 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #37 of 37 (100 per page; Change: )
|