> http://fgiesen.wordpress.com/2009/12/13/decoding-morton-codes/
On Sep 28, 2:52 pm, "yako...@gmail.com" <yako...@gmail.com> wrote: > Hello > For the data flow graph G= (V,E),I have to determine a partition - in > such a way that > sub graphs created could be computed in parallel and the sub graphs > are approximately of the same size > (sqrt(|V|)) > For example as in graph attached (http://i55.tinypic.com/35lvu6x.png- > the graph should be directed upwards) - B0,B1,B2 - describe partially > the partition. > 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.
