Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper
Query: Computing Top-k Closeness Centrality in Fully-dynamic Graphs
A Fast Algorithm for Streaming Betweenness Centrality
Finding the K Shortest Loopless Paths in a Network
Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees
CP-index: on the efficient indexing of large graphs
Colibri: fast mining of large static and dynamic graphs
Efficient Parallel Ear Decomposition of Graphs with Application to Betweenness-Centrality
Partitioning graphs to speedup Dijkstra's algorithm
Measuring Large-Scale Dynamic Graph Similarity by RICom: RWR with Intergraph Compression
Efficient graphlet kernels for large graph comparison
Distance Closures on Complex Networks
Graph nodes clustering based on the commute-time kernel
A Highly Efficient Runtime and Graph Library for Large Scale Graph Analytics
A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification
Finding top-k similar graphs in graph databases
1 Kernels for graphs
Graph Connectivity
Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation
Scaling Hop-Based Reachability Indexing for Fast Graph Pattern Query Processing
From centrality to temporary fame: dynamic centrality in complex networks
Rank Centrality: Ranking from Pair-wise Comparisons
Exploring the effect of vibrotactile feedback through the floor on social presence in an immersive virtual environment
RPCA: a novel preprocessing method for PCA
Design of 8-bit SAR-ADC CMOS
the diameter of the world wide web .
Deployment of the PON with an optical fibre G-652.B