Tree inclusions in windows and slices

Abstract : $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. Given two trees (a target $T$ and a pattern $P$) and a natural number $w$, we address two problems: 1. counting the number of windows of $T$ having height exactly $w$ and containing pattern $P$ as an embedded subtree, and 2. counting the number of slices of $T$ having height exactly $w$ and containing pattern $P$ as an embedded subtree.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [5 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00159127
Contributor : Irene Guessarian <>
Submitted on : Tuesday, July 3, 2007 - 1:05:59 PM
Last modification on : Friday, January 4, 2019 - 5:32:57 PM
Document(s) archivé(s) le : Thursday, April 8, 2010 - 10:16:25 PM

Files

cg.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00159127, version 1

Collections

Citation

Patrick Cegielski, Irene Guessarian. Tree inclusions in windows and slices. 2007. ⟨hal-00159127⟩

Share

Metrics

Record views

343

Files downloads

121