Overview

This is the open source project KaDraw - Karlsruhe Graph Drawing.
So far, it contains the algorithm MulMent [1] which is alternative iterative local optimizer suggested by Gansner et. al usable and fast in practice.
MulMent is a multilevel algorithm tailored to large networks. Its main drawing routine is a local optimizer suggested by Gansner et al. [2], which we have made fast in practice. Moreover, MulMent employs a coarsening algorithm for building the multilevel hierarchy that can control the trade-off between the number of hierarchy levels and convergence speed of the local optimizer. The speed of the local optimizer stems from (i) shared-memory parallelism and (ii) approximation of long-range forces by using coarser representatives stored in the multilevel hierarchy.

Example drawing of bcsstk31:

News:September 2015: Initial Release of MulMent codes within the framework.

Licence

The program is licenced under GPL 2.0. Please let us know if you need a commercial licence.
If you publish results using our algorithms, please acknowledge our work by quoting the following paper: