Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper.
Query: Better Approximation of Betweenness Centrality
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
Approximatingk-center in planar graphs
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
Degree centrality in scientific collaboration supernetwork
Quantifying and Comparing Centrality Measures for Network Individuals as Applied to the Enron Corpus
Shortest-path kernels on graphs
Commonsense reasoning based on betweenness and direction in distributional models
Centrality based Document Ranking
Computing Personalized PageRank Quickly by Exploiting Graph Structures
An Efficient Algorithm for Optimizing Bipartite Modularity in Bipartite Networks
Tighter Bounds for Graph Steiner Tree Approximation
From centrality to temporary fame: dynamic centrality in complex networks
Improved approximations for the Steiner tree problem
Faster algorithms for the shortest path problem
Applying weighted PageRank to author citation networks
Crossing minimization in weighted bipartite graphs
Super-Spreader Identification Using Meta-Centrality
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds
Community detection algorithms: a comparative analysis
Empirical comparison of algorithms for network community detection
bedeutung des crp - werts fur die d - dimer - testung in der internistischen notaufnahme .
Network robustness and fragility: percolation on random graphs.
Gender stereotypes about intellectual ability emerge early and influence children’s interests
performance analysis of data mining algorithms for breast cancer cell detection using naive bayes , logistic regression and decision tree .
on computing minimal correction subsets .