Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper.
Query: distance preserving graph simplification .
A sketch-based distance oracle for web-scale graphs
I/O-complexity of graph algorithms
Geometric Shape Abstraction and Simplification
Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs
Asymmetric Transitivity Preserving Graph Embedding
A Linear-Time Graph Kernel
KickStarter: Fast and Accurate Computations on Streaming Graphs via Trimmed Approximations
Fast iterative graph computation: a path centric approach
Structural Pursuit Over Multiple Undirected Graphs
An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs
FANNG: Fast Approximate Nearest Neighbour Graphs
a fast multi - dimensional algorithm for drawing large graphs ∗ .
GraphTwist: Fast Iterative Graph Computation with Two-tier Optimizations
laws of graph evolution : densification and shrinking diameters .
Measuring Graph Reconstruction Precisions: How Well Do Embeddings Preserve the Graph Proximity Structure?
A Simple Algorithm for Subgraph Queries in Big Graphs.
A distance measure between attributed relational graphs for pattern recognition
Simple fast algorithms for the editing distance between trees and related problems
Using Persistent Homology to Represent Online Social Network Graphs
Efficient Graph Similarity Search Over Large Graph Databases
Substructure similarity search in graph databases
Robotic Pick-and-Place of Novel Objects in Clutter with Multi-Affordance Grasping and Cross-Domain Image Matching
Semantics-based Graph Approach to Complex Question-Answering
Branding yourself
Discovering Finance Keywords via Continuous-Space Language Models