kunzmilan wrote: > 1) Start with the graph and its adjacency matrix. Put cameras in all > single connected rooms. Eliminate all these rooms together with their > adjacent rooms from the graph. > 2) You get a new smaller graph. Continue as in 1). > kunzmilan
This does not take the "values" of the nodes into consideration. I don't see a straightforward solution to the original problem. Complete enumeration might work only for very small trees. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
