Edge Partitioning algorithms


I see that some well known algorithms such as UnionFind, LPA, Louvain are all vertex partition algorithms. Can we also see some implementations of some Edge Partitioning algorithms in the data Science package? I strongly feel that Edge Partitioning will allow collapsing multiple nodes into single nodes while storing the information about the clusters in the edges.

Examples of edge partitioning algorithm:

Hope this helps. Looking forward to hear your comments.


Good idea! I'll pass on your ideas to @alicia.frame who's the Product Manager for the Graph Data Science Library.

1 Like