- 0of 0 votes
You are given a tree (a simple connected graph with no cycles).You have to remove as many edges from the tree as possible to obtain a forest with the condition that : Each connected component of the forest contains even number of vertices- NIC September 12, 2012 in United States
Your task is to calculate the number of removed edges in such a forest.
| Report Duplicate | Flag | PURGE
Open Chat in New Window