Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper
Query: MARGIN: Maximal Frequent Subgraph Mining
gSpan: graph-based substructure pattern mining
State of the art of graph-based data mining
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Fast mining frequent itemsets using Nodesets
Association Rules with Graph Patterns
Efficient distributed subgraph similarity matching
Community detection in graphs through correlation
Graph mining: Laws, generators, and algorithms
Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set
Efficient Maximal Clique Enumeration Over Graph Data
Finding Maximal Clique In A Graph
Efficiently mining frequent trees in a forest
CASQD: continuous detection of activity-based subgraph pattern queries on dynamic graphs
Community detection in graphs
An Algorithm for Subgraph Isomorphism
SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs
MAFIA: a maximal frequent itemset algorithm
Efficient Data Mining Algorithms for Mining Frequent/Closed/Maximal Itemsets
Mining Graphlet Counts in Online Social Networks
A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network
Ultralow-Loss CMOS Copper Plasmonic Waveguides
matrix computations ( 3 . ed . ) .
Dielectric Tube Antennas for Industrial Radar Level Gauging
Amorphous silicon thin film transistor circuit integration for organic LED displays on glass and plastic
The vsaUT-II: A novel rotational variable stiffness actuator