RAIRO-Theor. Inf. Appl.
Volume 42, Number 1, January-March 2008A nonstandard spirit among computer scientists:a tribute to Serge Grigorieff at the occasion of his 60th birthday
|Page(s)||5 - 20|
|Published online||18 January 2008|
Tree inclusion problems
LACL EA 4213, Université Paris Est, Route
forestière Hurtault, 77300 Fontainebleau, France;
2 LIAFA, UMR 7089 and Université Paris 6, 2 place Jussieu, 75254 Paris Cedex 5, France; firstname.lastname@example.org
3 Steklov Institute of Mathematics, Fontanka 27, St. Petersburg, 191023, Russia; email@example.com
Given two trees (a target T and a pattern P) and a natural number w, window embedded subtree problems consist in deciding whether P occurs as an embedded subtree of T and/or finding the number of size (at most) w windows of T which contain pattern P as an embedded subtree. P is an embedded subtree of T if P can be obtained by deleting some nodes from T (if a node v is deleted, all edges adjacent to v are also deleted, and outgoing edges are replaced by edges going from the parent of v (if it exists) to the children of v). Deciding whether P is an embedded subtree of T is known to be NP-complete. Our algorithms run in time O(|T|22|P|) where |T| (resp. |P|) is the size of T (resp. P).
Mathematics Subject Classification: 68Q25 / 68W05
Key words: Subtree inclusion / algorithm
© EDP Sciences, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.