A note on the subtree isomorphism for ordered trees and related problems

DOI10.1016/0020-0190(91)90159-FzbMath0739.68043OpenAlexW2070895427MaRDI QIDQ1182123

Roberto Grossi

Publication date: 27 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)90159-f

zbMATH Keywords

parallel algorithmpattern matchingordered treesEREW PRAMtree isomorphismsubtree matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Constrained tree inclusion

Cites Work

• Data structures and algorithms for approximate string matching
• On the subtree isomorphism problem for ordered trees
• Pattern Matching in Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the subtree isomorphism for ordered trees and related problems