Some comments on the subtree isomorphism problem for ordered trees

DOI10.1016/0020-0190(90)90154-PMaRDI QIDQ918705zbMATH OpenFDO

Authors Pratul Dublish

Publication date 1990

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

ordered treessubtree isomorphism problem

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Strings, trees, and patterns
• On an algorithm of Zemlyachenko for subtree isomorphism
• A note on the subtree isomorphism for ordered trees and related problems
• Subtree isomorphism revisited
• Further comments on the subtree isomorphism for ordered trees

Cites work

• An Analysis of a Good Algorithm for the Subtree Problem
• Lexicographic generation of ordered trees
• On the subtree isomorphism problem for ordered trees

Cited in

(5)

• On the subtree isomorphism problem for ordered trees
• Strings, trees, and patterns
• On an algorithm of Zemlyachenko for subtree isomorphism
• Constrained tree inclusion
• Further comments on the subtree isomorphism for ordered trees

This page was built for publication: Some comments 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 Q918705)