On the subtree isomorphism problem for ordered trees
From MaRDI portal
Publication:1124598
DOI10.1016/0020-0190(89)90056-2zbMATH Open0679.05024OpenAlexW1978139332MaRDI QIDQ1124598FDOQ1124598
Authors: Erkki Mäkinen
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90056-2
Recommendations
Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Algorithms in computer science (68W99)
Cites Work
Cited In (14)
- An efficient algorithm for some tree matching problems
- TOWARDS PARALLEL PROGRAMMING BY TRANSFORMATION: THE FAN SKELETON FRAMEWORK*
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
- On finding common subtrees
- Learning grammars for architecture-specific facade parsing
- Title not available (Why is that?)
- Linear matching-time algorithm for the directed graph isomorphism problem
- Strings, trees, and patterns
- Some comments on the subtree isomorphism problem for ordered trees
- A note on the subtree isomorphism for ordered trees and related problems
- Further comments on the subtree isomorphism for ordered trees
- Title not available (Why is that?)
- Constrained tree inclusion
This page was built for publication: On the subtree isomorphism problem for ordered trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124598)