Pages that link to "Item:Q2425250"
From MaRDI portal
The following pages link to Probabilistic and exact frequent subtree mining in graphs beyond forests (Q2425250):
Displaying 7 items.
- Efficient mining for structurally diverse subgraph patterns in large molecular databases (Q413872) (← links)
- Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649) (← links)
- Probabilistic frequent subtrees for efficient graph classification and retrieval (Q1631835) (← links)
- On subtree number index of generalized book graphs, fan graphs, and wheel graphs (Q2035665) (← links)
- Polynomial-delay enumeration of monotonic graph classes (Q2880911) (← links)
- Full Perfect Extension Pruning for Frequent Subgraph Mining (Q3627910) (← links)
- (Q5149013) (← links)