Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper.
Query: Graph Matching by Simplified Convex-Concave Relaxation Procedure
Deformable Graph Matching
A convex relaxation approach for computing minimal partitions
PDGM: Percolation-based directed graph matching in social networks
Efficient random graph matching via degree profiles
Dynamic Programming with Convexity, Concavity, and Sparsity
A near linear time constant factor approximation for Euclidean bichromatic matching (cost)
Generalized Graph Pattern Matching
Similarity flooding: a versatile graph matching algorithm and its application to schema matching
Graph Matching with Anchor Nodes: A Learning Approach
an o ( sqrt ( | v | ) | e | ) algorithm for finding maximum matching in general graphs .
Path Similarity Skeleton Graph Matching
Hyper-graph matching via reweighted random walks
Fast approximate energy minimization via graph cuts
Image Segmentation via Probabilistic Graph Matching
Popular Edges and Dominant Matchings
Sparse PCA via Bipartite Matchings
Efficient Subgraph Matching on Billion Node Graphs
Efficient distributed subgraph similarity matching
Growing a Graph Matching from a Handful of Seeds
Performance Comparison of Five Exact Graph Matching Algorithms on Biological Databases
Molecular docking studies for discovery of plant-derived α-glucosidase inhibitors
EEVi - framework for evaluating the effectiveness of visualization in cyber-security
Interactive HDR Environment Map Capturing on Mobile Devices
Sequential LSTM-based Encoder for NLI
Probabilistic graph and hypergraph matching