Finding Minimum Spanning Forests in a Graph

Abdel-Rahman Madkour, Phillip Nadolny, Matthew Wright

We introduce a graph partitioning problem motivated by computational topology and propose two algorithms that produce approximate solutions. Specifically, given a weighted, undirec…