Further comments on the subtree isomorphism for ordered trees

DOI10.1016/0020-0190(91)90119-3zbMath0770.05035OpenAlexW2009632739MaRDI QIDQ1183481

Roberto Grossi

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90119-3

zbMATH Keywords

subtree isomorphismMäkinen's algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Constrained tree inclusion

Cites Work

• Some comments on the subtree isomorphism problem for ordered trees
• On the subtree isomorphism problem for ordered trees
• Unnamed Item
• Unnamed Item

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