Tree inclusions in windows and slices - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2007

Tree inclusions in windows and slices

Résumé

$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.
Fichier principal
Vignette du fichier
cg.pdf (137.92 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00159127 , version 1 (03-07-2007)

Identifiants

  • HAL Id : hal-00159127 , version 1

Citer

Patrick Cegielski, Irene Guessarian. Tree inclusions in windows and slices. 2007. ⟨hal-00159127⟩
288 Consultations
142 Téléchargements

Partager

Gmail Facebook X LinkedIn More