Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper
Query: Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs
a faster algorithm for betweenness centrality ∗ .
Fast iterative graph computation: a path centric approach
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
Distributed computation on graphs: shortest path algorithms
Diversified ranking on large graphs: an optimization viewpoint
High quality, scalable and parallel community detection for large real graphs
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
GraphCT: Multithreaded Algorithms for Massive Graph Analysis
STREAMER: A distributed framework for incremental closeness centrality computation
Faster parallel traversal of scale free graphs at extreme scale with vertex delegates
Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing
Powergraph: Distributed graphparallel computation on natural graphs
TurboGraph: a fast parallel graph engine handling billion-scale graphs in a single PC
A Parallel Shortest Path Algorithm Based on Graph-Partitioning and Iterative Correcting
An Improved Algorithm for Matching Large Graphs
Centrality in valued graphs: A measure of betweenness based on network flow
Fast and practical indexing and querying of very large graphs
On Graph Query Optimization in Large Networks
Routing betweenness centrality
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Muscle-Based Control for Character Animation
A dynamic model for integrating simple web spam classification techniques
Resonant Wireless Charging System Design for 110-kV High-Voltage Transmission Line Monitoring Equipment
Disentangled Person Image Generation