The following pages link to (Q4423976):
Displaying 3 items.
- Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649) (← links)
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach (Q2194034) (← links)
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph (Q4842123) (← links)