Efficient parallel algorithms for graph problems

Keyphrases

• Parallel Algorithm 100%
• Graph Problems 100%
• Sorting Algorithm 33%
• Minimum Spanning Tree 33%
• Models of Computation 33%
• Shared Memory 33%
• Sparse Graphs 33%
• Spanning Tree 33%
• Linear Speedup 33%
• Graph Algorithms 33%
• Connected Component 33%
• Radix Sort 33%
• Linked List 33%
• Parallel Prefix 33%
• Parallel Manipulation 33%
• Parallel Radix Sort 33%
• Memory Access Conflict 33%
• Machine Model 33%

Computer Science

• Parallel Algorithm 100%
• Data Structure 33%
• MIMD 33%
• Spanning Tree 33%
• Memory Access 33%
• Model of Computation 33%
• Graph Algorithms 33%
• Linear Speedup 33%
• Connected Component 33%
• Linked List 33%
• Shared Memory 33%
• Minimum Spanning Tree 33%