Hello For the digrah G(V,E),I have to find all the sub graphs so that that every subgraph will include k=(sqrt(|V|)) leaves Do you have idea for algorithm? Thank you very much
-- 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?hl=en.
