Learning Unordered Tree Contraction Patterns in Polynomial Time
From MaRDI portal
Recommendations
- Efficient learning of ordered and unordered tree patterns with contractible variables
- On exact learning of unordered tree patterns
- Polynomial time algorithms for finding unordered tree patterns with internal variables
- Learning unions of tree patterns using queries
- Learning unions of tree patterns using queries
- The Complexity of Learning Tree Patterns from Example Graphs
- On learning unions of pattern languages and tree patterns
- Learning of finite unions of tree patterns with internal structured variables from queries
- Learning of finite unions of tree patterns with repeated internal structured variables from queries
- scientific article; zbMATH DE number 996383
Cited in
(4)- Polynomial time algorithms for finding unordered tree patterns with internal variables
- Polynomial time pattern matching algorithm for ordered graph patterns
- The Complexity of Learning Tree Patterns from Example Graphs
- Efficient learning of ordered and unordered tree patterns with contractible variables
This page was built for publication: Learning Unordered Tree Contraction Patterns in Polynomial Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928423)