Tree inclusion problems

Abstract : 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).
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01260272
Contributor : Irene Guessarian <>
Submitted on : Thursday, January 21, 2016 - 6:35:05 PM
Last modification on : Friday, January 4, 2019 - 5:32:57 PM

Links full text

Identifiers

Collections

Citation

Irene Guessarian, Patrick Cégielski, Yuri Matiyasevich. Tree inclusion problems. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2008, 42 (1), pp.5-20. ⟨http://www.rairo-ita.org/articles/ita/abs/2008/01/ita07048/ita07048.html⟩. ⟨10.1051/ita:2007052⟩. ⟨hal-01260272⟩

Share

Metrics

Record views

66