r even constant round complexity.
***It baffles me***, but as much as I know about the results, they are correct
and provable. The time complexities are pretty cool. It would be really
interesting to see how does these complex algorithms serve on a system like
Giraph.
Best Regards,
Mohit Dag
Hej,
My name is Mohit Daga. I am a PhD student at KTH - Sweden. I study theory of
distributed graph algorithms. In the theory community, a model called the
Congested Clique model [0] is exactly similar to the vertex centric model of
Giraph. Through this email, I would like to pitch a project
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 wrote:
> hi Folks,
>
> Is it possible to pursu
[
https://issues.apache.org/jira/browse/GIRAPH-1135?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15904423#comment-15904423
]
Mohit Daga commented on GIRAPH-1135:
Hi [~cmartella]
Thanks for creating the
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 wrote:
> Hi Claudio,
> Thanks for the email. Can you help me regarding this?
>
> Could you point me to code for existing a
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"
wrote:
Hi,
It would certainly be of help!
Best,
Claudio
On Sun, 19 Feb 2017 at 04:06, Mohit D
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
