Weighted undirected graph partitioning?

The spanning tree will not be binary and the usage of AVL for balancing by vertex weights is unclear to me. Do you have any details on your idea? Yet, I'm rather confused.

– user605379 Feb 6 at 18:54.

It is some sort of balanced cut problem which is NP Complete in general and has logarithmic factor approximation algorithms. If im correct then it is weakly NP hard in planar graphs with 2 approx algorithm by naveen garg.(chk it on google).

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.