If anyone interested to help here is a full question Thank you http://cstheory.stackexchange.com/questions/1944/digraph-partitioning-to-subgraphs
On Oct 4, 6:55 pm, Yakov <yako...@gmail.com> wrote: > 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 algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
