On Chen and Chen's new tree inclusion algorithm

DOI10.1016/J.IPL.2007.02.006zbMATH Open1187.68678OpenAlexW2046348079MaRDI QIDQ2379934FDOQ2379934

Authors: Hai-Lung Cheng, Biing-Feng Wang 

Publication date: 24 March 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.02.006

Recommendations

• On the tree inclusion problem
• scientific article; zbMATH DE number 1638647
• A new tree inclusion algorithm
• New and improved algorithms for unordered tree inclusion
• Automata, Languages and Programming

zbMATH Keywords

algorithmstreestree inclusion

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• On the complexity of finding iso- and other morphisms for partial \(k\)- trees
• Ordered and Unordered Tree Inclusion
• More Efficient Algorithm for Ordered Tree Inclusion
• A new tree inclusion algorithm

Cited In (3)

• A survey on tree matching and XML retrieval
• Title not available (Why is that?)
• The tree inclusion problem

This page was built for publication: On Chen and Chen's new tree inclusion algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379934)