Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper.
Query: A binary linear programming formulation of the graph edit distance
A tree-edit-distance algorithm for comparing simple, closed shapes
On computational complexity of length embeddability of graphs
deBGR: An efficient and near-exact representation of the weighted de Bruijn graph
Crossing minimization in weighted bipartite graphs
Algorithmic Aspects of Vertex Elimination on Graphs
Quantitative Analysis of Graph Algorithms: Models and Optimization Methods
Survey of Graph Matching Algorithms
A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
Strong sum distance in fuzzy graphs
Algorithms for the Longest Common Subsequence Problem
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
Generating Accurate and Compact Edit Scripts Using Tree Differencing
An Efficient Algorithm for Graph Isomorphism
Distributed computation on graphs: shortest path algorithms
Backtrack search algorithms and the maximal common subgraph problem
Fast parallel algorithms for graph similarity and matching
Inexact graph matching using genetic search
Bed-tree: an all-purpose index structure for string similarity search based on edit distance
Computing the shortest path: A search meets graph theory
The geometry of graphs and some of its algorithmic applications
A graduated assignment algorithm for graph matching
Enterprise Cognitive Computing Applications: Opportunities and Challenges
of lane and obstacle detection for an autonomous , self - guided vehicle succeeds by tailoring vision and computational techniques to an affordable simd architecture .
Improved FIFO Scheduling Algorithm Based on Fuzzy Clustering in Cloud Computing
Low-voltage switched-capacitor circuits