Sharif University of TechnologyScientia Iranica1026-309817220101201Minimum Height Path Partitioning of Trees3349ENA.BagheriDepartment of Computer Engineering and IT,Amirkabir University of TechnologyM.RazzaziDepartment of Computer Science and Engineering,Amirkabir University of TechnologyJournal Article20110103Graph partitioning is a well-known problem in the literature. In this paper, path
partitioning of trees in which the given tree is partitioned into edge-disjoint paths is considered. A linear time algorithm is given for computing a path partitioning of minimum height.https://scientiairanica.sharif.edu/article_3349_49e610d7ea25d75a36c5142971484cc9.pdf