Query primitives for tree-structured data
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 213-225
- https://doi.org/10.1007/3-540-58094-8_19
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Faster tree pattern matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A note on the subtree isomorphism for ordered trees and related problemsInformation Processing Letters, 1991
- The tree inclusion problemPublished by Springer Nature ,1991
- Some comments on the subtree isomorphism problem for ordered treesInformation Processing Letters, 1990
- Complexity of matching problemsJournal of Symbolic Computation, 1987
- Formatting Structure Documents: Batch versus Interactive?Published by Cambridge University Press (CUP) ,1986
- Pattern Matching in TreesJournal of the ACM, 1982
- Finding patterns common to a set of stringsJournal of Computer and System Sciences, 1980
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973