Given a weighted directed graph G={V,E}. The goal is to obtain its
spanning forest with maximum sum of weights of edges. The direction of
each edge is from root to leave.
Is this problem NP-Hard?
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
