Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

On Chen and Chen's new tree inclusion algorithm

From MaRDI portal
Publication:2379934
Jump to:navigation, search

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

Biing-Feng Wang, Hai-Lung Cheng

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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2379934&oldid=15007988"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 2 February 2024, at 18:44. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki