[
https://issues.apache.org/jira/browse/FLINK-1526?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Flink Jira Bot updated FLINK-1526:
----------------------------------
Labels: algorithm auto-deprioritized-major auto-unassigned (was:
algorithm auto-unassigned stale-major)
Priority: Minor (was: Major)
This issue was labeled "stale-major" 7 days ago and has not received any
updates so it is being deprioritized. If this ticket is actually Major, please
raise the priority and ask a committer to assign you the issue or revive the
public discussion.
> Add Minimum Spanning Tree library method and example
> ----------------------------------------------------
>
> Key: FLINK-1526
> URL: https://issues.apache.org/jira/browse/FLINK-1526
> Project: Flink
> Issue Type: New Feature
> Components: Library / Graph Processing (Gelly)
> Reporter: Vasia Kalavri
> Priority: Minor
> Labels: algorithm, auto-deprioritized-major, auto-unassigned
>
> 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)
