Probabilistic and exact frequent subtree mining in graphs beyond forests
From MaRDI portal
Publication:2425250
DOI10.1007/s10994-019-05779-1zbMath1493.68323MaRDI QIDQ2425250
Stefan Wrobel, Tamás L. Horváth, Pascal Welke
Publication date: 26 June 2019
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-019-05779-1
05C05: Trees
68T05: Learning and adaptive systems in artificial intelligence
68R10: Graph theory (including graph drawing) in computer science
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
- Efficient frequent connected subgraph mining in graphs of bounded tree-width
- 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
- Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask).
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- An Algorithm for Subgraph Isomorphism
- Faster Subtree Isomorphism
- Frequent Hypergraph Mining
- Depth-First Search and Linear Graph Algorithms
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
