1
Department of Computer Engineering and IT,Amirkabir University of Technology
2
Department of Computer Science and Engineering,Amirkabir University of Technology
Abstract
Graph 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.
