Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper.
Query: A space-efficient parallel algorithm for computing betweenness centrality in distributed memory
A Parallelization of Dijkstra's Shortest Path Algorithm
Data Parallel Algorithms
The parallel bgl: A generic library for distributed graph computations
On Identifying Strongly Connected Components in Parallel
Review on Parallel and Distributed Computing
Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs
A Comparison of Parallel Graph Processing Benchmarks.
An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing
DSMR: A Parallel Algorithm for Single-Source Shortest Path Problem
An analysis of dag-consistent distributed shared-memory algorithms
GPU centric extensions for parallel strongly connected components computation
The Distributed Computing Paradigms: P2P, Grid, Cluster, Cloud, and Jungle
A Scalable Distributed Graph Partitioner
BFS and Coloring-Based Parallel Algorithms for Strongly Connected Components and Related Problems
Distributed Computation of Large-scale Graph Problems
A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)
Broadcast Communications and Distributed Algorithms
Finding strongly connected components in distributed graphs
Routing betweenness centrality
STREAMER: A distributed framework for incremental closeness centrality computation
Neuromorphic Silicon Neurons and Large-Scale Neural Networks: Challenges and Opportunities
GLoMo: Unsupervised Learning of Transferable Relational Graphs.
Recognizing and Justifying Text Entailment through Distributional Navigation on Definition Graphs
Preserving order in a forest in less than logarithmic time
Feature Selection for Stock Market Analysis