In the present paper we deal with equipartition problems for special classes of trees, i.e., spiders, stars, worms, and caterpillars. We prove that the equipartition problem is NP-complete for spiders (and, hence, for general trees); on the other hand, we give efficient polynomial-time algorithms for stars, worms, and caterpillars.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.