carmelo is talking about a tree, I think that you don't ned to present it as a graph to have the solution.
My suggestion: visit all the nodes of the tree and obtain N_even(number of nodes which are at even depth from the root) and N_odd(number of nodes which are on odd depth from the root). Put cameras on nodes on even or odd depth from the root depending on which of N_even or N_odd is bigger. I still can not prove this algorithm to be correct. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
