I have encountered an interesting problem that I couldn't find any references to solve:
Determine the smallest subset of nodes that need to be removed from an undirected graph to make it a tree.
Obviously when a node is removed, the edges connecting to it are also removed.
Any help would be very much appreciated. Thank you in advance!