Proceedings of the International Conference on Computer, Networks and Communication Engineering (ICCNCE 2013)

<Previous Article In Volume
Next Article In Volume>

On the Tree Inclusion Problem

Authors
Yangjun Chen, Yibin Chen
Corresponding Author
Yangjun Chen
Available Online July 2013.
DOI
10.2991/iccnce.2013.32How to use a DOI?
Keywords
tree inclusion, ordered labeled trees, tree matching.
Abstract

The ordered tree inclusion is an interesting problem, by which we will check whether a pattern tree P can be included in a target tree T, in which the order of siblings is significant. In this paper, we propose an efficient algorithm for this problem.Its time com­plexity is almost linear in the size of T and P. Up to now the best algorithm for this problem needs quadratic time.

Copyright
© 2013, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the International Conference on Computer, Networks and Communication Engineering (ICCNCE 2013)
Series
Advances in Intelligent Systems Research
Publication Date
July 2013
ISBN
978-90-78677-67-3
ISSN
1951-6851
DOI
10.2991/iccnce.2013.32How to use a DOI?
Copyright
© 2013, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

risenwbib
TY  - CONF
AU  - Yangjun Chen
AU  - Yibin Chen
PY  - 2013/07
DA  - 2013/07
TI  - On the Tree Inclusion Problem
BT  - Proceedings of the International Conference on Computer, Networks and Communication Engineering (ICCNCE 2013)
PB  - Atlantis Press
SP  - 131
EP  - 135
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccnce.2013.32
DO  - 10.2991/iccnce.2013.32
ID  - Chen2013/07
ER  -