[
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-unassigned stale-major (was: algorithm
auto-unassigned)
I am the [Flink Jira Bot|https://github.com/apache/flink-jira-bot/] and I help
the community manage its development. I see this issues has been marked as
Major but is unassigned and neither itself nor its Sub-Tasks have been updated
for 30 days. I have gone ahead and added a "stale-major" to the issue". If this
ticket is a Major, please either assign yourself or give an update. Afterwards,
please remove the label or in 7 days the issue will be deprioritized.
> 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: Major
> Labels: algorithm, auto-unassigned, stale-major
>
> 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)
