Probabilistic and exact frequent subtree mining in graphs beyond forests
From MaRDI portal
Publication:2425250
Recommendations
- Efficient frequent subtree mining beyond forests
- Probabilistic frequent subtrees for efficient graph classification and retrieval
- Nearly exact mining of frequent trees in large networks
- Frequent subtree mining -- an overview
- Efficient frequent connected subgraph mining in graphs of bounded tree-width
Cites work
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An Algorithm for Subgraph Isomorphism
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- Complexity of Finding Embeddings in a k-Tree
- Depth-First Search and Linear Graph Algorithms
- Efficient frequent connected subgraph mining in graphs of bounded tree-width
- Efficient frequent subtree mining beyond forests
- Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask)
- Faster Subtree Isomorphism
- Frequent Hypergraph Mining
- Frequent subtree mining -- an overview
- Graph minors. II. Algorithmic aspects of tree-width
- scientific article; zbMATH DE number 1651999 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256746 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
- On generating all maximal independent sets
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- Probabilistic frequent subtrees for efficient graph classification and retrieval
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
Cited in
(10)- Probabilistic frequent subtrees for efficient graph classification and retrieval
- On subtree number index of generalized book graphs, fan graphs, and wheel graphs
- Mine 'em all: a note on mining all graphs
- Polynomial-delay enumeration of monotonic graph classes
- Efficient frequent subtree mining beyond forests
- Full Perfect Extension Pruning for Frequent Subgraph Mining
- Efficient mining for structurally diverse subgraph patterns in large molecular databases
- scientific article; zbMATH DE number 7306903 (Why is no real title available?)
- An uncertain graph classification algorithm based on discriminative subgraphs
- Efficient frequent connected subgraph mining in graphs of bounded tree-width
This page was built for publication: Probabilistic and exact frequent subtree mining in graphs beyond forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425250)
