-----------------------------------
We are pleased to announce the release of our graph drawing framework
KaDraw (Karlsruhe Graph Drawing). So far, it contains MulMent which is a
multilevel algorithm to optimize maxent-stress on large networks. Its
main drawing routine is a local optimizer suggested by Gansner et al.,
which we accelerated in practice. 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.
The software is released under the GPL 2.0 License.
* open source implementation / website
http://algo2.iti.kit.edu/kadraw/
We are glad for any comments and error reports (or even bug fixes) that
you send us.
Henning Meyerhenke, Martin Nöllenburg and Christian Schulz,
Karlsruhe Institute of Technology (KIT) and TU Wien (TUW)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
