A decomposition of a graph into dense subgraphs

A density of a graph is defined as the maximum number of disjoint spanning trees of the graph. Using this density an algorithm to find all the subgraphs of a given density of a graph is developed. The decomposition is unique when a density is given. The algorithm is efficient.