Description:
To simplify analyzing connections between groups in multipartite graphs, minimizing edge crossings is a good way to do so. In this work, by using the algorithm suggested in the paper “An Edge Crossing Minimization Algorithm Based on Adjacency Matrix Transformation�?, implementation for gephi platform is performed.
Author:
Sources:
github.com/kemalceng/gephi-plugins/License:
GPL v3
Compatible Gephi versions:
When possible, you should directly install this plugin from Gephi
Tools > Pluginsmenu. The following download links may be useful to spread this plugin to people with no internet access, for instance.