[
https://issues.apache.org/jira/browse/FLINK-3925?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15289626#comment-15289626
]
ASF GitHub Bot commented on FLINK-3925:
---------------------------------------
GitHub user greghogan opened a pull request:
https://github.com/apache/flink/pull/2005
[FLINK-3925] GraphAlgorithm to filter by maximum degree
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/greghogan/flink
3925_graphalgorithm_to_filter_by_maximum_degree
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/flink/pull/2005.patch
To close this pull request, make a commit to your master/trunk branch
with (at least) the following in the commit message:
This closes #2005
----
commit d1ed3e89b343c6d156ff3e2e44dd659e98fe5edd
Author: Greg Hogan <[email protected]>
Date: 2016-05-18T15:28:24Z
[FLINK-3925] GraphAlgorithm to filter by maximum degree
----
> GraphAlgorithm to filter by maximum degree
> ------------------------------------------
>
> Key: FLINK-3925
> URL: https://issues.apache.org/jira/browse/FLINK-3925
> Project: Flink
> Issue Type: New Feature
> Components: Gelly
> Affects Versions: 1.1.0
> Reporter: Greg Hogan
> Assignee: Greg Hogan
> Priority: Minor
> Fix For: 1.1.0
>
>
> Filtering by minimum degree is K-Core which is iterative. Filtering by
> maximum degree can be performed in constant time by filtering the set of
> high-degree vertices then doing an anti-join against the original vertex set
> and two anti-joins against the original edge set.
> Two reasons to remove high-degree vertices: 1) they may simply be noise in
> the input data, and 2) speedup algorithms such as Adamic-Adar and Jaccard
> Index which run quadratic in the vertex degree.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
