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.
Simple Layout for directed acyclic graphs (DAGs).More Info
Network Splitter 3D
This layout can be used to split a network layout into distinct Z-Layers (Network Splitter 3D Z-Layers are user-defined clusters). E.g. after using layouts such as: Yifan Hu, Fruchterman Reingold, Force Atlas, Circular, Layered, OpenOrd, etc. Computed Z-Layers can be used in Gephi ranking and/or partition procedures. To use this plugin it is quite simple: [...]More Info
Author Clement Levallois, Assistant Professor at EMLYON Business School. Function Distributes the nodes according to the alphabetical order of their labels. Useful to layout isolated nodes properly, for instance. Request for features, bug reports? Simply open a ticket on Github! version 1.0 (February 2013): initial release version 1.1 (May 2013): fixed issue when different [...]More Info