[
https://issues.apache.org/jira/browse/FLINK-2254?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15441673#comment-15441673
]
Ivan Mushketyk commented on FLINK-2254:
---------------------------------------
[~vkalavri] I went through the paper listed in this issue, but I still have
some questions.
If I understand correctly bipartite graph should be analyzed differently than a
regular (one-mode) graph. For example in case of movies/actors graph, we may
consider that two actors are connected if they have a movie in common, a
conclusion we can come to only if we know that the graph is bipartite.
I wonder if we should treat bipartite graph is a special case of graph? In
other words does all operations (methods and algorithms) defined for the Graph
class make sense for a bipartite graph?
Also the issue description mentions that "We would like to support efficient
operations for this type of graphs". What are these operations? Are there any
operations additional operations that we need for bipartiate graph?
> Add Bipartite Graph Support for Gelly
> -------------------------------------
>
> Key: FLINK-2254
> URL: https://issues.apache.org/jira/browse/FLINK-2254
> Project: Flink
> Issue Type: New Feature
> Components: Gelly
> Affects Versions: 0.10.0
> Reporter: Andra Lungu
> Assignee: Ivan Mushketyk
> Labels: requires-design-doc
>
> A bipartite graph is a graph for which the set of vertices can be divided
> into two disjoint sets such that each edge having a source vertex in the
> first set, will have a target vertex in the second set. We would like to
> support efficient operations for this type of graphs along with a set of
> metrics(http://jponnela.com/web_documents/twomode.pdf).
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
