Mailing-List: contact issues-help@flink.apache.org; run by ezmlm
Precedence: bulk
Reply-To: dev@flink.apache.org
Date: Wed, 23 Sep 2015 15:23:05 +0000 (UTC)
From: "Andra Lungu (JIRA)" <jira@apache.org>
To: issues@flink.apache.org
Message-ID: <JIRA.12774226.1423666675000.50544.1443021785336@Atlassian.JIRA>
In-Reply-To: <JIRA.12774226.1423666675000@Atlassian.JIRA>
References: <JIRA.12774226.1423666675000@Atlassian.JIRA>
 <JIRA.12774226.1423666675152@arcas>
Subject: [jira] [Updated] (FLINK-1526) Add Minimum Spanning Tree library
 method and example
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8
Content-Transfer-Encoding: 7bit


     [ https://issues.apache.org/jira/browse/FLINK-1526?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Andra Lungu updated FLINK-1526:
-------------------------------
    Assignee:     (was: Andra Lungu)

> 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
(v6.3.4#6332)