Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns
From MaRDI portal
Publication:5452096
Recommendations
- Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining
- Learning block-preserving graph patterns and its application to data mining
- Graph pattern matching with expressive outerplanar graph patterns
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
- Complete mining of frequent patterns from graphs: Mining graph data
Cites work
- scientific article; zbMATH DE number 1950784 (Why is no real title available?)
- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns
- Faster Subtree Isomorphism
- Inductive Logic Programming
- Ordered term tree languages which are polynomial time inductively inferable from positive data
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time
Cited in
(3)
This page was built for publication: Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452096)