Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper.
Query: Fast shortest path distance estimation in large networks
Efficiently indexing shortest paths by exploiting symmetry in graphs
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks
compact routing on power law graphs with additive stretch .
Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach
Learning an Integrated Distance Metric for Comparing Structure of Complex Networks
Efficient Behavior of Small-World Networks
Near linear time algorithm to detect community structures in large-scale networks
Exacting Eccentricity for Small-World Networks
Accurate Estimation of the Degree Distribution of Private Networks
Computing Communities in Large Networks Using Random Walks
Authentication of k Nearest Neighbor Query on Road Networks
A Divide-and-Conquer Algorithm for Betweenness Centrality
An analysis of stochastic shortest path problems
Gephi: An Open Source Software for Exploring and Manipulating Networks
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
A quick method for finding shortest pairs of disjoint paths
Fast Dynamic Routing Based on Weighted Kernel Density Estimation.
Community detection in large‐scale networks: a survey and empirical evaluation
Fast influence-based coarsening for large networks
Fast approximation of centrality and distances in hyperbolic graphs
Unbounded cache model for online language modeling with open vocabulary
Alternative energy technologies
A Vegetable Category Recognition System Using Deep Neural Network
Introduction to Algorithms
" novel aspects coming from the directionality of online relationships : a case study of twitter " by haewoon kwak , changhyun lee , hosung park , hyunwoo chun and sue moon with ching - man au yeung as coordinator .