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 >
