Reconstruction of rooted directed trees
Let T be a rooted directed tree on n vertices, rooted at v. The rooted subtree frequency vector (RSTF-vector ) of T with root v, denoted by rstf(T, v) is a vector of length n whose entry at position k is the number of subtrees of T that contain v and have exactly k vertices. In this paper we present...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2019
|
| Sorozat: | Acta cybernetica
24 No. 2 |
| Kulcsszavak: | Algoritmus |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.24.2.2019.5 |
| Online Access: | http://acta.bibl.u-szeged.hu/64711 |
| Tartalmi kivonat: | Let T be a rooted directed tree on n vertices, rooted at v. The rooted subtree frequency vector (RSTF-vector ) of T with root v, denoted by rstf(T, v) is a vector of length n whose entry at position k is the number of subtrees of T that contain v and have exactly k vertices. In this paper we present an algorithm for reconstructing rooted directed trees from their rooted subtree frequencies (up to isomorphism). We show that there are examples of nonisomorphic pairs of rooted directed trees that are RSTF-equivalent, that is they share the same rooted subtree frequency vectors. We have found all such pairs (groups) for small sizes by using exhaustive computer search. We show that infinitely many nonisomorphic RSTF-equivalent pairs of trees exist by constructing infinite families of examples. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 249-262 |
| ISSN: | 0324-721X |