[
https://issues.apache.org/jira/browse/FLINK-1526?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17323742#comment-17323742
]
Flink Jira Bot commented on FLINK-1526:
---------------------------------------
This issue is assigned but has not received an update in 7 days so it has been
labeled "stale-assigned". If you are still working on the issue, please give an
update and remove the label. If you are no longer working on the issue, please
unassign so someone else may work on it. In 7 days the issue will be
automatically unassigned.
> 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: Library / Graph Processing (Gelly)
> Reporter: Vasia Kalavri
> Assignee: Xingcan Cui
> Priority: Major
> Labels: algorithm, stale-assigned
>
> 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
(v8.3.4#803005)
