Skip to Main Content
Future Communication, Information and Computer Science
book

Future Communication, Information and Computer Science

by Dawei Zheng
February 2015
Intermediate to advanced content levelIntermediate to advanced
472 pages
22h 58m
English
CRC Press
Content preview from Future Communication, Information and Computer Science
Future Communication, Information and Computer Science Zheng (Ed.)
© 2015 Taylor & Francis Group, London, 978-1-138-02653-7
A time and space efficient algorithm for the tree inclusion problem
Y.J. Chen & Y.B. Chen
University of Winnipeg, Winnipeg, Manitoba, Canada
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 complexity is bounded by O(|T d
P
· log h
P
), where d
P
represents
the largest out-degree of a node in P and h
P
is the height ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Frontiers in Computer Education

Frontiers in Computer Education

Yuanzhi Wang
The CS Detective

The CS Detective

Jeremy Kubica

Publisher Resources

ISBN: 9781138026537