Pages that link to "Item:Q413859"
From MaRDI portal
The following pages link to Effective feature construction by maximum common subgraph sampling (Q413859):
Displaying 6 items.
- Efficient mining for structurally diverse subgraph patterns in large molecular databases (Q413872) (← links)
- Probabilistic frequent subtrees for efficient graph classification and retrieval (Q1631835) (← links)
- Finding the best not the most: regularized loss minimization subgraph selection for graph classification (Q1669622) (← links)
- On maximum common subgraph problems in series-parallel graphs (Q1678090) (← links)
- Mining closed patterns in relational, graph and network data (Q2248524) (← links)
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525) (← links)