Central Forests in Trees
| dc.creator | Rao, Shrisha | |
| dc.creator | Grover, Babita | |
| dc.date | 2008-09-02 | |
| dc.date.accessioned | 2026-07-07T09:59:56Z | |
| dc.date.available | 2026-07-07T09:59:56Z | |
| dc.description | A new 2-parameter family of central structures in trees, called central forests, is introduced. Minieka's $m$-center problem and McMorris's and Reid's central-$k$-tree can be seen as special cases of central forests in trees. A central forest is defined as a forest $F$ of $m$ subtrees of a tree $T$, where each subtree has $k$ nodes, which minimizes the maximum distance between nodes not in $F$ and those in $F$. An $O(n(m+k))$ algorithm to construct such a central forest in trees is presented, where $n$ is the number of nodes in the tree. The algorithm either returns with a central forest, or with the largest $k$ for which a central forest of $m$ subtrees is possible. Some of the elementary properties of central forests are also studied. | |
| dc.description | 42 pages | |
| dc.identifier | https://arxiv.org/abs/0809.0349 | |
| dc.identifier | http://arxiv.org/abs/0809.0349 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/168203 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C05; 05C12; 05C75; 68R10; 05C85 | |
| dc.title | Central Forests in Trees | |
| dc.type | text |