flink-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Olga Golovneva (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (FLINK-1526) Add Minimum Spanning Tree library method and example
Date Thu, 08 Sep 2016 17:35:21 GMT

    [ https://issues.apache.org/jira/browse/FLINK-1526?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15474504#comment-15474504

Olga Golovneva commented on FLINK-1526:

Hi Greg,
I didn't found much details about this issue either, here is what I have: http://mail-archives.apache.org/mod_mbox/flink-dev/201504.mbox/%3cCAJZ2dcUgxRxsDxh_Rq4dr52eGO+OUT5Oz+5N5xm2AN5psrxyag@mail.gmail.com%3e
I suppose, the problem was in data caching within a loop

> Add Minimum Spanning Tree library method and example
> ----------------------------------------------------
>                 Key: FLINK-1526
>                 URL: https://issues.apache.org/jira/browse/FLINK-1526
>             Project: Flink
>          Issue Type: Task
>          Components: Gelly
>            Reporter: Vasia Kalavri
> This issue proposes the addition of a library method and an example for distributed minimum
spanning tree in Gelly.
> The DMST algorithm is very interesting because it is quite different from PageRank-like
iterative graph algorithms. It consists of distinct phases inside the same iteration and requires
a mechanism to detect convergence of one phase to proceed to the next one. Current implementations
in vertex-centric models are quite long (>1000 lines) and hard to understand.
> You can find a description of the algorithm [here | http://ilpubs.stanford.edu:8090/1077/3/p535-salihoglu.pdf]
and [here | http://www.vldb.org/pvldb/vol7/p1047-han.pdf].

This message was sent by Atlassian JIRA

View raw message