Algorithm to find minimum spanning tree of chosen vertices?

What you want to find is a discrete Steiner tree . When not all vertices in the graph are mandatory but the tree is allowed to split at the optional vertices, the problem is NP-hard.

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.