Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper.
Query: the parmol package for frequent subgraph mining .
Efficient mining of frequent subgraphs in the presence of isomorphism
Search Strategies for Subgraph Isomorphism Algorithms
A Fast Algorithm for Subgraph Pattern Matching on Large Labeled Graphs
A Two-Phase Algorithm for Differentially Private Frequent Subgraph Mining
Frequent subgraph discovery in dynamic networks
Efficient subgraphisomorphism detection: a decomposition approach
Discovering highly reliable subgraphs in uncertain graphs
Graph mining: A survey of graph mining techniques
Beyond Frequencies: Graph Pattern Mining in Multi-weighted Graphs
SQBC: An efficient subgraph matching method over large and dense graphs
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
Probabilistic subgraph matching based on convex relaxation
DualIso : Scalable Subgraph Pattern Matching On Large Labeled Graphs SUPPLEMENT
Multi-Query Optimization for Subgraph Isomorphism Search
Colibri: fast mining of large static and dynamic graphs
Backtrack search algorithms and the maximal common subgraph problem
Fast Approximate Subgraph Counting and Enumeration
Graph-Structured Sparse Optimization for Connected Subgraph Detection
Finding Dynamic Dense Subgraphs
Graph summaries for subgraph frequency estimation
Package characterization on advanced NBA-QFN structure
ESPNetv2: A Light-Weight, Power Efficient, and General Purpose Convolutional Neural Network
An empirical study on predicting user acceptance of e-shopping on the Web
Efficiently mining frequent trees in a forest
Anonymity for Bitcoin with accountable mixes ( Full version )