Can any tree on $n$ nodes be decomposed into a set of $O(\log n)$ caterpillars? If not, what is the maximum number of caterpillars required? Are there efficient algorithms for finding the decomposition?Any papers on this topic will be highly appreciated.
Caterpillar decomposition of trees
ds.algorithms;graph theory;graph algorithms;tree