flink-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Greg Hogan (JIRA)" <j...@apache.org>
Subject [jira] [Created] (FLINK-4934) Triadic Census
Date Wed, 26 Oct 2016 14:03:58 GMT
Greg Hogan created FLINK-4934:

             Summary: Triadic Census
                 Key: FLINK-4934
                 URL: https://issues.apache.org/jira/browse/FLINK-4934
             Project: Flink
          Issue Type: New Feature
          Components: Gelly
    Affects Versions: 1.2.0
            Reporter: Greg Hogan
            Assignee: Greg Hogan

A triad is any three vertices in a graph. An undirected graph has 4 types of triads (with
0, 1, 2, or 3 edges among the three vertices) and a directed graph has 16 types (http://vlado.fmf.uni-lj.si/pub/networks/doc/triads/triads.pdf).

This can be implemented as an analytic. The undirected implementation will use {{VertexMetrics}}
and {{TriangleCount}}. The directed implementation will use {{VertexDegrees}} and {{TriangleListing}}
with postprocessing.

This could be added to the {{TriangleListing}} driver in Gelly examples.

This message was sent by Atlassian JIRA

View raw message