Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper
Query: A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston
Efficient mining of frequent subgraphs in the presence of isomorphism
On the Variable Ordering in Subgraph Isomorphism Algorithms
Backtrack search algorithms and the maximal common subgraph problem
g-Miner: Interactive Visual Group Mining on Multivariate Graphs
G-Miner: an efficient task-oriented graph mining system
Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics
Subgraph-centric Large-Scale Graph Analytics on Spark
Statistical Selection of Congruent Subspaces for Mining Attributed Graphs
A Two-Phase Algorithm for Differentially Private Frequent Subgraph Mining
Benchmarking Graph Databases on the Problem of Community Detection
Efficient distributed subgraph similarity matching
A distributed approach for graph mining in massive networks
Arboricity and subgraph listing algorithms
Subdue: compression-based frequent pattern discovery in graph data
Discovering highly reliable subgraphs in uncertain graphs
ApproxRank: Estimating Rank for a Subgraph
DualIso : Scalable Subgraph Pattern Matching On Large Labeled Graphs SUPPLEMENT
Duplicate Reduction in Graph Mining: Approaches, Analysis, and Evaluation
Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases
A Graph Distance Metric Based on the Maximal Common Subgraph
Employing 60 GHz ISM band for 5G wireless communications
Mining frequent patterns without candidate generation
A Computational Framework for Influenza Antigenic Cartography
Treatment of juvenile idiopathic arthritis: a revolution in care
No . 067 April 4 , 2017 Theory of Deep Learning III : Generalization Properties of SGD by