Thanks to Claudio, for creating the JIRA issue. [1] I work towards writing a proposal as part of Google Summer of Code.
Thanks Mohit [1] https://issues.apache.org/jira/browse/GIRAPH-1135 On Wed, Mar 1, 2017 at 2:49 AM, Mohit Daga <mohitdag...@gmail.com> wrote: > hi Folks, > > Is it possible to pursue the MST algorithm implementation as a Google > Summer of Code project? > > Mohit > > On Tue, Feb 21, 2017 at 5:52 AM, Mohit Daga <mohitdag...@gmail.com> wrote: > >> Hi Claudio, >> Thanks for the email. Can you help me regarding this? >> >> Could you point me to code for existing algorithms in Giraph. >> >> Thanks >> >> Mohit. >> >> On Feb 21, 2017 05:24, "Claudio Martella" <claudio.marte...@gmail.com> >> wrote: >> >> Hi, >> >> It would certainly be of help! >> >> Best, >> Claudio >> On Sun, 19 Feb 2017 at 04:06, Mohit Daga <mohitdag...@gmail.com> wrote: >> >> > Hi, >> > >> > I am Mohit Daga [1], a masters student at IIT MADRAS. >> > >> > Recently Parter et. al. gave a log* algorithm for finding MST in the >> > CONGESTED-CLIQUE model [2]. A model for which direct connections have >> been >> > shown with Pregel or Giraph. >> > >> > Pandurangan et. al. also gave a result for MST and connectivity [3] >> > >> > I wanted to know if this would be interesting to implement this >> algorithm >> > on top of GIRAPH? >> > >> > Cheers, >> > Mohit >> > >> > [1] https://sites.google.com/view/mohitdaga >> > [2] http://dl.acm.org/citation.cfm?doid=2933057.2933103 >> > [3] https://arxiv.org/pdf/1503.02353.pdf >> > >> >> >> >
