Those two results hold for the max mean weight subtree problem, don't they?
On Jan 29, 4:27 am, LazyBoy <[EMAIL PROTECTED]> wrote: > You can find some of the answers in this paperhttp://arxiv.org/pdf/cs/0503023 > > Some of the results given are: > - A linear-time algorithm to solve the problem with positive weights > - A proof of NP-Completeness when negative weights are allowed > > On Jan 29, 2:09 pm, Debajit Adhikary <[EMAIL PROTECTED]> wrote: > > > > On Jan 29, 2008 3:07 PM, Debajit Adhikary <[EMAIL PROTECTED]> wrote: > > > > > Lets say I have a weighted tree (with positive, zero and negative > > > > weights for each node). > > > > How could I best find the subtree having the maximum weight? > > > On Jan 29, 3:55 am, "Yingjie Xu" <[EMAIL PROTECTED]> wrote: > > > > A rooted tree or a general tree? > > > It is a rooted weighted tree, where each node is assigned a weight > > which can be positive, zero or negative. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
