Some comments on the subtree isomorphism problem for ordered trees

DOI10.1016/0020-0190(90)90154-PzbMath0706.68056MaRDI QIDQ918705

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

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

Related Items (2)

Further comments on the subtree isomorphism for ordered trees ⋮ Constrained tree inclusion

Cites Work

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

This page was built for publication: Some comments on the subtree isomorphism problem for ordered trees