Before revision:  In this paper we present partitioning algorithms for cactus graphs to show that these partition problems are polynomial-time solvable for this graph class as well .
After revision:  In this paper we present partitioning algorithms for cactus graphs . For other optimization goals or additional constraints, the partition problem becomes NP-hard even on trees and for a lower weight bound equal to zero. We show that our method can be used as an algorithmic framework to solve other partition problems for cactus graphs in pseudo-polynomial time .