Monday, April 30, 2018

[DMANET] Vienna Graph Clustering

Release of VieClus v1.00------------------------------------

We are proud to announce the release of our memetic graph clustering framework VieClus (Vienna Graph Clustering). It includes several heuristics to compute a clustering of a graph. We provide it as easy to use open source software. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. We combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time.

************************************************************ 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/***********************************************************