Polynomial time pattern matching algorithm for ordered graph patterns
From MaRDI portal
Recommendations
- A polynomial time matching algorithm of structured ordered tree patterns for data mining from semistructured data
- Learning Unordered Tree Contraction Patterns in Polynomial Time
- A polynomial time matching algorithm of ordered tree patterns having height-constrained variables
- Polynomial time inductive inference of ordered tree patterns with internal structured variables from positive data
- Efficient pattern matching on graph patterns of bounded treewidth
Cited in
(2)
This page was built for publication: Polynomial time pattern matching algorithm for ordered graph patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928410)